𝔖 Bobbio Scriptorium
✦   LIBER   ✦

General Antifactors of Graphs

✍ Scribed by A. Sebo

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
428 KB
Volume
58
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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. LovΓ‘sz (Period. Math. Hungar. 4, Nos. 2-3, 1973, 121-123), where the case when everyone has one unlucky number (antifactor problem) is answered. In this paper we give a "Tutte-type good characterization" (and a simple polynomial algorithm) to decide this question when several unlucky numbers are allowed, but no one in the company has two neighboring unlucky numbers. i 1993 Academic Press. Inc.

πŸ“œ SIMILAR VOLUMES

Graph generators
Graph generators
✍ Milan RandiΔ‡; Wayne L. Woodworth; Alexander F. Kleiner; Haruo Hosoya πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 942 KB

We consider the construction of highly symmetrical vertex transitive graphs. Some such graphs represent the degenerate rearrangements in which a molecule or an ion is formed by breaking and making bonds so that the final and the initial skeleton is identical. The approach is closely related to Cayle

Generation of isospectral graphs
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

Generalizations of planar graphs
Generalizations of planar graphs
✍ Ranel E. Erickson πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 677 KB
A general class of invulnerable graphs
A general class of invulnerable graphs
✍ F. T. Boesch; A. P. Felzer πŸ“‚ Article πŸ“… 1972 πŸ› John Wiley and Sons 🌐 English βš– 1004 KB

The idea of u t i Z i z i n g the connectivity properties of a graph as measures of i t s vulnerability has been welZ docwnented. graph t h e o r e t i c concepts and the b a s i c resuZts of t h i s theory are r e v i m e d here. are defined and compared. SpecificaZZy a class of graphs called teZe

Drug-Induced Antifactor VIII Antibodies
Drug-Induced Antifactor VIII Antibodies
✍ Massimo Franchini; Franco Capra; Nicoletta Nicolini; Dino Veneri; Franco Manzato πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons βš– 11 KB

## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.