✦ LIBER ✦

Regular Subgraphs of a Regular Graph

✍ Scribed by MIKIO KANO

Book ID: 119862777
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 214 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16409.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Spectra of Complementary Subgraphs i

The Spectra of Complementary Subgraphs in a Strongly Regular Graph

✍ D. de Caen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 117 KB

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

An Application of a Construction Theory

An Application of a Construction Theory of Strongly Closed Subgraphs in a Distance-regular Graph

✍ A. Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 112 KB

## Let be a distance-regular graph with where r ≥ 2 and c r +1 > 1. We prove that r = 2 except for the case a 1 = a r +1 = 0 and c r +1 = 2 by showing the existence of strongly closed subgraphs.

A Characterization of the Hamming Graphs

A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs

✍ Akira Hiraki 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 222 KB

On bipartite distance-regular graphs wit

On bipartite distance-regular graphs with a strongly closed subgraph of diameter three

✍ Qian Kong; Kaishun Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 216 KB

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB