𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homogeneity conditions in graphs

✍ Scribed by A Gardiner

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
629 KB
Volume
24
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Homomorphism–homogeneous graphs
Homomorphism–homogeneous graphs
✍ Momchil Rusinov; Pascal Schweitzer 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

## Abstract We answer two open questions posed by Cameron and Nesetril concerning homomorphism–homogeneous graphs. In particular we show, by giving a characterization of these graphs, that extendability to monomorphism or to homomorphism leads to the same class of graphs when defining homomorphism–

Homogeneously representable interval gra
Homogeneously representable interval graphs
✍ Dale Skrien; John Gimbel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 258 KB

## We characterize those interval graphs G with the property that, for every vertex u, there exists an interval represention of G in which the interval representing 21 is the left-most (or right-most) interval in the representation.

Locally homogeneous graphs from groups
Locally homogeneous graphs from groups
✍ Andrew Vince 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A graph is called locally homogeneous if the subgraphs induced at any two points are isomorphic. in this Note we give a method for constructing locally homogeneous graphs from groups. the graphs constructable in this way are exactly the locally homogeneous graphs with a point symmetric

Homogeneous Graphs and Regular Near Poly
Homogeneous Graphs and Regular Near Polygons
✍ K. Nomura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon