✦ LIBER ✦

Extremal graphs with given order and the rupture degree

✍ Scribed by Yinkui Li; Shenggui Zhang

Book ID: 108077595
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 263 KB
Volume: 60
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.07.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum radius of graphs with given

The maximum radius of graphs with given order and minimum degree

✍ Byeong Moon Kim; Yoomi Rho; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 205 KB

ON EXTREMAL GRAPHS WITH GIVEN DIAMETER A

ON EXTREMAL GRAPHS WITH GIVEN DIAMETER AND CONNECTIVITY

✍ Louis Caccetta 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 794 KB

The minimum order of a cayley graph with

The minimum order of a cayley graph with given degree and diameter

✍ Yahya Ould Hamidoune 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Large graphs with given degree and diame

Large graphs with given degree and diameter. II

✍ J.C Bermond; C Delorme; G Farhi 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Some large graphs with given degree and

Some large graphs with given degree and diameter

✍ I. Alegre; M. A. Fiol; J. L. A. Yebra 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

This paper considers the (A, 0 ) problem: to maximize the order of graphs with given maximum degree A and diameter 0, of importance for its implications in the design of interconnection networks. Two cubic graphs of diameters 5 and 8 and orders 70 and 286, respectively, and a graph of degree 5, diam