Wiener-type invariants on graph properties

Qiannan Zhou; Ligong Wang; Yong Lu

doi:10.2298/FIL1802489Z

Wiener-type invariants on graph properties

Qiannan Zhou, Ligong Wang, Yong Lu

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

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

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

Original language	English
Pages (from-to)	489-502
Number of pages	14
Journal	Filomat
Volume	32
Issue number	2
DOIs	https://doi.org/10.2298/FIL1802489Z
State	Published - 2018

Keywords

Degree sequence
Graph properties
Wiener-type index

Access to Document

10.2298/FIL1802489Z

Cite this

@article{fd038022da084942aac3fb68f55041cd,

title = "Wiener-type invariants on graph properties",

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

keywords = "Degree sequence, Graph properties, Wiener-type index",

author = "Qiannan Zhou and Ligong Wang and Yong Lu",

year = "2018",

doi = "10.2298/FIL1802489Z",

language = "英语",

volume = "32",

pages = "489--502",

journal = "Filomat",

issn = "0354-5180",

publisher = "Universitet of Nis",

number = "2",

}

TY - JOUR

T1 - Wiener-type invariants on graph properties

AU - Zhou, Qiannan

AU - Wang, Ligong

AU - Lu, Yong

PY - 2018

Y1 - 2018

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

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

KW - Degree sequence

KW - Graph properties

KW - Wiener-type index

UR - http://www.scopus.com/inward/record.url?scp=85048000288&partnerID=8YFLogxK

U2 - 10.2298/FIL1802489Z

DO - 10.2298/FIL1802489Z

M3 - 文章

AN - SCOPUS:85048000288

SN - 0354-5180

VL - 32

SP - 489

EP - 502

JO - Filomat

JF - Filomat

IS - 2

ER -

Wiener-type invariants on graph properties

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this