✦ LIBER ✦

Calculating the edge Wiener and edge Szeged indices of graphs

✍ Scribed by H. Yousefi-Azari; M.H. Khalifeh; A.R. Ashrafi

Book ID: 108076837
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 355 KB
Volume: 235
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.02.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Szeged and the Wiener index of graph

The Szeged and the Wiener index of graphs

✍ S. Klavžar; A. Rajapakse; I. Gutman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 283 KB

On the Edge-forwarding Indices of Froben

On the Edge-forwarding Indices of Frobenius Graphs

✍ Yan Wang; Xin Gui Fang; D. F. Hsu 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 183 KB

Vertex and edge PI indices of Cartesian

Vertex and edge PI indices of Cartesian product graphs

✍ M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On the Extremal Zagreb Indices of Graphs

On the Extremal Zagreb Indices of Graphs with Cut Edges

✍ Yanqin Feng; Xia Hu; Shuchao Li 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 566 KB

The edge-bandwidth of theta graphs

✍ Dennis Eichhorn; Dhruv Mubayi; Kevin O'Bryant; Douglas B. West 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B H (G) min f {B H (f )}, where B H (f ) is the maximum difference between labels of incident edges of G. The theta graph Â(l 1 , F F F ,l m ) is the graph consisting of m pairwise internally

The edge reconstruction of hamiltonian g

The edge reconstruction of hamiltonian graphs

✍ L. Pyber 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB 👁 1 views

## Abstract If a graph __G__ on __n__ vertices contains a Hamiltonian path, then __G__ is reconstructible from its edge‐deleted subgraphs for __n__ sufficiently large.