✦ LIBER ✦

Semisymmetry of Generalized Folkman Graphs

✍ Scribed by Dragan Marušič; Primož Potočnik

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 221 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0473

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized Pigeonhole Properties of Gra

Generalized Pigeonhole Properties of Graphs and Oriented Graphs

✍ Anthony Bonato; Peter J Cameron; Dejan Delić; Stéphan Thomassé 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 152 KB

A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied

Generalized exponents of primitive direc

Generalized exponents of primitive directed graphs

✍ Richard A. Brualdi; Bolian Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

## Abstract The exponent of a primitive digraph is the smallest integer __t__ such that for each ordered pair of (not necessarily distinct) vertices __x__ and __y__ there is a path of length __t__ from __x__ to __y__. There is considerable information known about bounds on exponents and those numbe

Generation of isospectral graphs

✍ Halbeisen, Lorenz; Hungerb�hler, Norbert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB 👁 1 views

We discuss a discrete version of Sunada's Theorem on isospectral manifolds, which allows the generation of isospectral simple graphs, i.e., nonisomorphic simple graphs that have the same Laplace spectrum. We also consider additional boundary conditions and Buser's transplantation technique applied t

General Antifactors of Graphs

✍ A. Sebo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

In a superstitious company everybody has numbers that he thinks to be unlucky for himself. When they meet, everybody wants to shake hands with some of his acquaintances, but nobody wants to shake hands with an unlucky number of acquaintances. When can this be successful? This question occurred to L.

A generalized construction of chromatic

A generalized construction of chromatic index critical graphs from bipartite graphs

✍ Michael Plantholt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

W e prove that any graph with maximum degree n which can be obtained by removing exactly 2n -1 edges from the join K? -K, ,, is n-critical This generalizes special constructions of critical graphs by S Fiorini and H P Yap, and suggests a possible extension of another general construction due to Yap

Equivalence of four descriptions of gene

Equivalence of four descriptions of generalized line graphs

✍ G. R. Vijayakumar 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 1 views

A new characterization of generalized line graphs, analogous to that of line graphs found by Van Rooij and Wilf [Acta Math Acad Sci Hungar 16 (1965), 263-269] is obtained. By a cycle of implications, we settle the equivalence of the definition of generalized line graph given by Hoffman [Combinatoria