✦ LIBER ✦

Distinguished vertices in probabilistic rooted graphs

✍ Scribed by Gary Gordon; Ekaterina Jager

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 129 KB
Volume: 55
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20363

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On eccentric vertices in graphs

✍ Chartrand, Gary; Schultz, Michelle; Winters, Steven J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB

The eccentricity e(u) of a vertex u in a connected graph G is the distance between u and a vertex furthest from u. The minimum eccentricity among the vertices of G is the radius rad G of G, and the maximum The radial number m(u) of u is the minimum eccentricity among the eccentric vertices of u, wh

Rooted induced trees in triangle-free gr

Rooted induced trees in triangle-free graphs

✍ Florian Pfender 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 68 KB

## Abstract For a graph __G__, let __t__(__G__) denote the maximum number of vertices in an induced subgraph of __G__that is a tree. Further, for a vertex __v__∈__V__(__G__), let __t__(__G, v__) denote the maximum number of vertices in an induced subgraph of __G__that is a tree, with the extra cond

Vertices of Small Degree in Uniquely Ham

Vertices of Small Degree in Uniquely Hamiltonian Graphs

✍ J.A. Bondy; Bill Jackson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Let G be a uniquely hamiltonian graph on n vertices. We show that G has a vertex of degree at most c log 2 8n+3, where c=(2&log 2 3) &1 r2.41. We show further that G has at least two vertices of degree less than four if it is planar and at least four vertices of degree two if it is bipartite.

Cycles containing 12 vertices in 3-conne

Cycles containing 12 vertices in 3-connected cubic graphs

✍ Sheng Bau; Derek Holton 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

## Abstract A necessary and sufficient condition is obtained for a set of 12 vertices in any 3‐connected cubic graph to lie on a common cycle.

Cycles passing through k + 1 vertices in

Cycles passing through k + 1 vertices in k-connected graphs

✍ Jun Fujisawa; Tomoki Yamashita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract In this article, we prove the following theorem. Let __k__ ≥ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give

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.