✦ LIBER ✦

THE HARARY INDEX OF A GRAPH UNDER PERTURBATION

✍ Scribed by HE, CHANG-XIANG; CHEN, PING; WU, BAO-FENG

Book ID: 120387789
Publisher: World Scientific
Year: 2010
Tongue: English
Weight: 205 KB
Volume: 02
Category: Article
ISSN: 1793-8309
DOI: 10.1142/S1793830910000620

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Additively weighted Harary index of some

Additively weighted Harary index of some composite graphs

✍ Yaser Alizadeh; Ali Iranmanesh; Tomislav Došlić 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 230 KB

On the Harary index for the characteriza

On the Harary index for the characterization of chemical graphs

✍ Dejan Plavšić; Sonja Nikolić; Nenad Trinajstić; Zlatko Mihalić 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 821 KB

The Shields-Harary indices of vulnerabil

The Shields-Harary indices of vulnerability of a graph

✍ F. Harary; P.D. Johnson Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 657 KB

In 1972 the late Allen Shields posed a striking conjecture, eventually confirmed by Schanuel [1], about finite sequences of positive numbers. Shields and the first author saw that the conjectured result gave the answer for paths to a question that could be asked about any graph. That realization has

The Laplacian spectral radius of a graph

The Laplacian spectral radius of a graph under perturbation

✍ Ji-Ming Guo 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 251 KB

In this paper, we investigate how the Laplacian spectral radius changes when one graph is transferred to another graph obtained from the original graph by adding some edges, or subdivision, or removing some edges from one vertex to another.

The algebraic connectivity of graphs und

The algebraic connectivity of graphs under perturbation

✍ Ji-Ming Guo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 160 KB

In this paper, we investigate how the algebraic connectivity of a connected graph behaves when the graph is perturbed by separating or grafting an edge.

Defining numbers in some of the Harary g

Defining numbers in some of the Harary graphs

✍ D.A. Mojdeh; A.P. Kazemi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 376 KB

## Defining set The defining number The strong defining number Harary graph a b s t r a c t In a given graph G = (V , E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a c