✦ LIBER ✦

Graphs with given neighborhoods of vertices

✍ Scribed by S. Ya. Agakishieva

Publisher: SP MAIK Nauka/Interperiodica
Year: 1968
Tongue: English
Weight: 199 KB
Volume: 3
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01094335

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal matchings in graphs with large n

Maximal matchings in graphs with large neighborhoods of independent vertices

✍ I. Rinsma; C. H. C. Little; D. R. Woodall 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

## Abstract We obtain lower bounds on the size of a maximum matching in a graph satisfying the condition |__N(X)__| ≥ __s__ for every independent set __X__ of __m__ vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp for the case __m__ = 2.

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

Broadcasting in m-dimensional grid graph

Broadcasting in m-dimensional grid graphs with a given neighborhood template

✍ Selma Djelloul 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Eulerian subgraphs containing given vert

Eulerian subgraphs containing given vertices and hamiltonian line graphs

✍ Hong-Jian Lai 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Let G be a graph and let DffG) be the set of vertices of degree 1 in G. Veldman (1994) proves the following conjecture from Benhocine et al. (1986) that if G-DI(G) is a 2-edge-connected simple graph with n vertices and if for every edge xy C E(G), d(x)+d(y) > (2n)/5 -2, then for n large, L(G), the l

Dense Graphs with Cycle Neighborhoods

✍ A. Seress; T. Szabo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 420 KB

For all \(\varepsilon>0\), we construct graphs with \(n\) vertices and \(>n^{2-n}\) edges, for arbitrarily large \(n\), such that the neighborhood of each vertex is a cycle. This result is asymptotically best possible. "1995 Academic Press. Inc.