✦ LIBER ✦

The Shields-Harary indices of vulnerability of a graph

✍ Scribed by F. Harary; P.D. Johnson Jr.

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 657 KB
Volume: 34
Category: Article
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(01)00062-0

No coin nor oath required. For personal study only.

✦ Synopsis

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 now germinated and produced a family of graph parameters that measure certain kinds of fortifiability of graphs, viewed as networks of storage fortresses. We discuss that family of parameters. (~) 2001 Elsevier Science Ltd. All rights reserved.

📜 SIMILAR VOLUMES

Lower bounds on the vulnerability of a g

Lower bounds on the vulnerability of a graph

✍ F. T. Boesch 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

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

A Ramsey problem of Harary on graphs wit

A Ramsey problem of Harary on graphs with prescribed size

✍ P Erdös; R.J Faudree; C.C Rousseau; R.H Schelp 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 411 KB

A rational selection of graph-theoretica

A rational selection of graph-theoretical indices in the QSAR

✍ Milan Randić; Aleksandar Sabljić; Sonja Nikolić; Nenad Trinajstić 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 1018 KB

The Irregularity Cost of a Graph

✍ F. Harary; O.R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A Multigraph His irregular if no two of its nodeahavethe samedegree.It hasbeen shownthat a graphis the underlying graphof some irregularMultigraph if and only if it has at most one trivialcomponentand no componentsof order2. We definethe irregularity cost of such a graph G to be the minimumnumberof

The biparticity of a graph

✍ Frank Harary; Derbiau Hsu; Zevi Miller 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract The biparticity β(__G__) of a graph __G__ is the minimum number of bipartite graphs required to cover __G__. It is proved that for any graph __G__, β(__G__) = {log~2~χ(__G__)}. In view of the recent announcement of the Four Color Theorem, it follows that the biparticity of every planar