✦ LIBER ✦

Two new families of large compound graphs

✍ Scribed by J. Gómez Martí; M. Miller

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 135 KB
Volume: 47
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20101

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some New Large Compound Graphs

✍ C. Delorme; J. Gómez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 111 KB

This paper deals with some new constructions of large ( , D) graphs, i.e., graphs with maximum degree and diameter D and many vertices. Most constructions presented here are based on the compound graphs technique. The basic idea of compound graphs consists of connecting together several copies of a

Large families of mutually embeddable ve

Large families of mutually embeddable vertex-transitive graphs

✍ Anthony Bonato; Claude Tardif 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract For each infinite cardinal κ, we give examples of 2^κ^ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all

New families of strongly regular graphs

✍ Yury J. Ionin; Hadi Kharaghani 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

Families of pairs of graphs with a large

Families of pairs of graphs with a large number of common cards

✍ Andrew Bowler; Paul Brown; Trevor Fenner 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

## Abstract The vertex‐deleted subgraph __G__−__v__, obtained from the graph __G__ by deleting the vertex __v__ and all edges incident to __v__, is called a card of __G__. The deck of G is the multiset of its unlabelled vertex‐deleted subgraphs. The number of common cards of __G__ and __H__ (or bet

Two New Classes of Difference Families

✍ Marco Buratti 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 75 KB

We construct, in a very simple way, two new classes of elementary abelian (q 2 , k, k&1) and (q 2 , k+1, k+1) difference families with k a multiple of q&1. The first of these classes contains, as special cases, the supplementary difference systems constructed by A.