Wiener-type invariants and hamiltonian properties of graphs

Qian Nan Zhou; Li Gong Wang; Yong Lu

doi:10.2298/FIL1913045Z

Wiener-type invariants and hamiltonian properties of graphs

Qian Nan Zhou
, Li Gong Wang
, Yong Lu

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

The Wiener-type invariants of a simple connected graph G = (V(G), E(G)) can be expressed in terms of the quantities W_f =^∑{u,v}⊆V(G) f (d_G (u, v)) for various choices of the function f (x), where d_G (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.

Original language	English
Pages (from-to)	4045-4058
Number of pages	14
Journal	Filomat
Volume	33
Issue number	13
DOIs	https://doi.org/10.2298/FIL1913045Z
State	Published - 2019

Keywords

Hamilton-connected
Hamiltonian
Traceable from every vertex
Wiener-type invariant

Access to Document

10.2298/FIL1913045Z

Cite this

@article{21ac9f55a7c24d8d9fce5101deb726f4,

title = "Wiener-type invariants and hamiltonian properties of graphs",

abstract = "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.",

keywords = "Hamilton-connected, Hamiltonian, Traceable from every vertex, Wiener-type invariant",

author = "Zhou, \{Qian Nan\} and Wang, \{Li Gong\} and Yong Lu",

year = "2019",

doi = "10.2298/FIL1913045Z",

language = "英语",

volume = "33",

pages = "4045--4058",

journal = "Filomat",

issn = "0354-5180",

publisher = "University of Nis",

number = "13",

}

TY - JOUR

T1 - Wiener-type invariants and hamiltonian properties of graphs

AU - Zhou, Qian Nan

AU - Wang, Li Gong

AU - Lu, Yong

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Hamilton-connected

KW - Hamiltonian

KW - Traceable from every vertex

KW - Wiener-type invariant

UR - https://www.scopus.com/pages/publications/85077698833

U2 - 10.2298/FIL1913045Z

DO - 10.2298/FIL1913045Z

M3 - 文章

AN - SCOPUS:85077698833

SN - 0354-5180

VL - 33

SP - 4045

EP - 4058

JO - Filomat

JF - Filomat

IS - 13

ER -

Wiener-type invariants and hamiltonian properties of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this