✦ LIBER ✦

Minimum order graphs with specified diameter, connectivity, and regularity

✍ Scribed by V. Krishnamoorthy; K. Thulasiraman; M. N. S. Swamy

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 977 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum graphs of specified diameter, co

Minimum graphs of specified diameter, connectivity and valence. II

✍ E. Engelhardt; V. Klee; K. Li; H. Quaife 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 769 KB

In order to avoid trivialities, it is assumed throughout that d 22, vacal, and ~23. A (d, c, v)-graph is a c-connected graph of diameter d in which each node is of valence v. The minimum order (number of nodes) of such graphs is denoted by p(d, c, v), and a minimum (d, c, v)-graph is one of minimum

Maximum matchings in a regular graph of

Maximum matchings in a regular graph of specified connectivity and bounded order

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 213 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

On graphs with equal edge-connectivity a

On graphs with equal edge-connectivity and minimum degree

✍ Donald L. Goldsmith; Arthur T. White 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 599 KB

It was proved by Chartrand f hat if G is a graph of order p for which the minimum degree is at least [&I, then the edge-connectivity of G equals the minimum degree of G. It is shown here that one may allow vertices of degree less than $p and still obtain the same conclusion, provided the degrees are

On graphs with equal edge connectivity a

On graphs with equal edge connectivity and minimum degree

✍ Béla Bollobás 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 255 KB

If a grrrph G hao edge connectivity A then the vertex fiat ha a partition V(a) = U U W ash that 61 esntainti exactly A edgea from U to W, Wen~se if Qo ia a maximal graph of order n and edge connectivity A than C$, is sbtctined from the dkjsint union of two complete oubgragh8, B,[U] and &T,[ Wg, by a

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will