𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the graphs with given diameter, number of vertices, and local diversity of balls

✍ Scribed by T. I. Fedoryaeva

Book ID
111471326
Publisher
Pleiades Publishing
Year
2011
Tongue
English
Weight
527 KB
Volume
5
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
✍ Louis Hakimi, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and SoltΓ©s: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

Unicyclic graphs with given number of pe
Unicyclic graphs with given number of pendent vertices and minimal energy
✍ Hongbo Hua; Maolin Wang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 196 KB

The energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all eigenvalues of the adjacency matrix of G. Let G(n, l, p) denote the set of all unicyclic graphs on n vertices with girth and pendent vertices being l ( 3) and p ( 1), respectively. More recently, one of the

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
✍ Andreas Holtkamp; Lutz Volkmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ ΞΊ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is