自爱
发表于 2025-3-30 10:37:37
http://reply.papertrans.cn/39/3880/387957/387957_51.png
Cpr951
发表于 2025-3-30 14:38:34
Automated Results and Conjectures on Average Distance in Graphs,ower and upper bounds, functions of the order . of . and ⊕ ∈ −, + ×, /. In 24 out of 48 cases simple bounds are obtained and proved by the system. In 21 more cases, the system provides bounds, 16 of which are proved by hand.
nutrients
发表于 2025-3-30 18:39:49
http://reply.papertrans.cn/39/3880/387957/387957_53.png
Constant
发表于 2025-3-30 22:23:38
http://reply.papertrans.cn/39/3880/387957/387957_54.png
Hot-Flash
发表于 2025-3-31 04:49:37
http://reply.papertrans.cn/39/3880/387957/387957_55.png
VEIL
发表于 2025-3-31 08:58:34
https://doi.org/10.1007/978-3-662-28405-6rom . to .. The goal of this paper is to establish some basic structural properties of this (and other related) quasi-orders. For instance, we show that ≻ has antichains of arbitrarily large finite size. It appears to be an interesting question to determine if ≻ has an infinite antichain.
滑稽
发表于 2025-3-31 11:32:48
On Edge-maps whose Inverse Preserves Flows or Tensions,rom . to .. The goal of this paper is to establish some basic structural properties of this (and other related) quasi-orders. For instance, we show that ≻ has antichains of arbitrarily large finite size. It appears to be an interesting question to determine if ≻ has an infinite antichain.
烤架
发表于 2025-3-31 15:11:34
https://doi.org/10.1007/978-1-4039-7854-7 is also well covered and has the same independence number. The notion of a 1-well-covered graph was introduced by J. Staples in her 1975 dissertation and was further investigated by M. Pinter in 1991 and later. In this note the 1-well-covered graphs with no 4-cycles are characterized.
大包裹
发表于 2025-3-31 20:00:31
http://reply.papertrans.cn/39/3880/387957/387957_59.png
intercede
发表于 2025-3-31 23:50:52
http://reply.papertrans.cn/39/3880/387957/387957_60.png