𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proximity and remoteness in graphs: Results and conjectures

✍ Scribed by Mustapha Aouchiche; Pierre Hansen

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
138 KB
Volume
58
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nordhaus–Gaddum relations for proximity
Nordhaus–Gaddum relations for proximity and remoteness in graphs
✍ M. Aouchiche; P. Hansen πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 300 KB

The transmission of a vertex in a connected graph is the sum of all distances from that vertex to the others. It is said to be normalized if divided by n -1, where n denotes the order of the graph. The proximity of a graph is the minimum normalized transmission, while the remoteness is the maximum n

A survey: Recent results, conjectures, a
A survey: Recent results, conjectures, and open problems in labeling graphs
✍ Joseph A. Gallian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 752 KB

In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.

Split-Neighborhood Graphs and the Strong
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture
✍ F. Maffray; M. Preissmann πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 649 KB

We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge's strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is