𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting loopy graphs with given degrees

✍ Scribed by Catherine Greenhill; Brendan D. McKay

Book ID
113771924
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
455 KB
Volume
436
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Large bipartite graphs with given degree
Large bipartite graphs with given degree and diameter
✍ C. Delorme πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 393 KB πŸ‘ 1 views

W e give constructions of bipartite graphs with maximum A, diameter D on B vertices. such :bat for every D 3 2 :he !im i nf , . . , B . A'"' = b,, > 0. W e also improve similar results on ordinary graphs, for example, w e prove that lim, , , N -A-." = 1 if D is 3 or 5. This is a partial answer to a

Cycles and paths in edge-colored graphs
Cycles and paths in edge-colored graphs with given degrees
✍ A. Abouelaoualim,; K. Ch. Das; W. Fernandez de la Vega; M. Karpinski; Y. Manouss πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 203 KB πŸ‘ 1 views

## Abstract Sufficient degree conditions for the existence of properly edge‐colored cycles and paths in edge‐colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edge‐colored multigraph of order __n__ on at least three colors and with minimum colored degre