✦ LIBER ✦

Characterization of Cycle Stochastic Graphs

✍ Scribed by K. Balasubramanian; V. Parameswaran; S.B. Rao

Book ID: 104444389
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 70 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00520-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of cycle-free unit pr

A characterization of cycle-free unit probe interval graphs

✍ David E. Brown; J. Richard Lundgren; Li Sheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A characterization of 1-cycle resonant g

A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs

✍ Sandi Klavžar; Khaled Salem 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Cycle interpolation properties of graphs

✍ Wl̵lodzimierz Ulatowski 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 456 KB

The length of a set of cycles of a graph G is the sum of the lengths of its cycles. Consider a family A, of n-element sets of cycles of G. Let c-(A,) and c+(A,) be the minimum and maximum lengths among all sets of A,, respectively. We say that A, has the cycle interpolation property (tip) if for eve

Cycle decompositions of complete graphs

✍ E.J. Farrell 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 447 KB

The circuit polynomial c%f the complete graph K, is used to deduce results about nodedisjoint -vcle decompositiorls of K,, satisfying variow restrictions.

Minimum cycle covers of graphs

✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Cycle spectra of Hamiltonian graphs

✍ Kevin G. Milans; Florian Pfender; Dieter Rautenbach; Friedrich Regen; Douglas B. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 152 KB