Wiener-type invariants and Hamiltonian properties of graphs | Zendy

Qiannan Zhou | Zendy; Ligong Wang | Zendy; Yong Lu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Wiener-type invariants and Hamiltonian properties of graphs

Author(s) -

Qiannan Zhou,

Ligong Wang,

Yong Lu

Publication year - 2019

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1913045z

Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , bipartite graph , graph , vertex (graph theory) , connectivity , wiener index , simple graph , discrete mathematics , mathematical optimization

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 give some sufficient conditions for a bipartite graph to be Hamiltonian or a connected general graph to be Hamilton-connected and traceable from every vertex in terms of the Wiener-type invariants of G or the complement of G.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research