𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for generating labelled graphs with given degree

✍ Scribed by V. Fack; J. Van der Jeugt

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
605 KB
Volume
37
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

(d,1)-total labeling of graphs with a gi
(d,1)-total labeling of graphs with a given maximum average degree
✍ MickaΓ«l Montassier; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 166 KB πŸ‘ 1 views

## Abstract The (__d__,1)‐total number $\lambda \_{d}^{T}(G)$ of a graph __G__ is the width of the smallest range of integers that suffices to label the vertices and the edges of __G__ so that no two adjacent vertices have the same color, no two incident edges have the same color, and the distance

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