𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite regular graphs with fixed diameter

✍ Scribed by H. J. Broersma; F. Göbel

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
420 KB
Volume
26
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular bipartite graphs are antimagic
Regular bipartite graphs are antimagic
✍ Daniel W. Cranston 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A labeling of a graph __G__ is a bijection from __E__(__G__) to the set {1, 2,… |__E__(__G__)|}. A labeling is __antimagic__ if for any distinct vertices __u__ and __v__, the sum of the labels on edges incident to __u__ is different from the sum of the labels on edges incident to __v__.

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

Tails of Bipartite Distance-regular Grap
Tails of Bipartite Distance-regular Graphs
✍ Michael S. Lang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let denote a bipartite distance-regular graph with diameter D ≥ 4 and valency k ≥ 3. Let θ 0 > θ 1 > • • • > θ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 ≤ s ≤ D -1) and abbreviate E := E s . We say E is a tail whenever the entry

Regular orientable embeddings of complet
Regular orientable embeddings of complete bipartite graphs
✍ Jin Ho Kwak; Young Soo Kwon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com