✦ LIBER ✦

Graphs with one isomorphism class of spanning unicyclic graphs

✍ Scribed by Preben D. Vestergaard

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 647 KB
Volume: 70
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90084-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isomorphism classes of cycle permutation

Isomorphism classes of cycle permutation graphs

✍ Jin Ho Kwak; Jaeun Lee 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 769 KB

In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycle permutation gr

Spanning subgraphs of graphs partitioned

Spanning subgraphs of graphs partitioned into two isomorphic pieces

✍ Anthony Bonato 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract A graph has the neighbor‐closed‐co‐neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed non‐neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

A note on distance matrices with unicycl

A note on distance matrices with unicyclic graph realizations

✍ J.M.S Simões-Pereira 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 643 KB

We give necessary and sufficient conditions for a distance matrix to have a unicycfic graph as unique optimal graph realization.

Enumeration of weak isomorphism classes

Enumeration of weak isomorphism classes of signed graphs

✍ Tadeusz Sozański 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 869 KB

## Abstract A signed graph is a graph in which each line has a plus or minus sign. Two signed graphs are said to be weakly isomorphic if their underlying graphs are isomorphic through a mapping under which signs of cycles are preserved, the sign of a cycle being the product of the signs of its line

On 4-isomorphisms of graphs

✍ G Lassmann 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 126 KB

On isomorphic factorizations of circulan

On isomorphic factorizations of circulant graphs

✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006