Wiener-type invariants on graph properties
Keyword(s):
The Wiener-type invariants of a simple connected graph G = (V(G),E(G)) can be expressed in terms of the quantities Wf = ?{u,v}?V(G) f(dG(u,v)) for various choices of the function f (x), where dG(u,v) is the distance between vertices u and v in G. In this paper, we mainly give some sufficient conditions for a connected graph to be k-connected, ?-deficient, k-hamiltonian, k-edge-hamiltonian, k-path-coverable or satisfy ?(G)? k.
2016 ◽
Vol 31
◽
pp. 27-41
◽
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129
2007 ◽
Vol 3
(1)
◽
pp. 143-148
◽
Keyword(s):
Keyword(s):