✦ LIBER ✦

Cliques and claws in edge-transitive strongly regular graphs

✍ Scribed by Arnold Neumaier

Publisher: Springer-Verlag
Year: 1980
Tongue: French
Weight: 274 KB
Volume: 174
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf01161408

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Co-cliques and star complements in extre

Co-cliques and star complements in extremal strongly regular graphs

✍ P. Rowlinson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Clique-transversal sets in 4-regular cla

Clique-transversal sets in 4-regular claw-free graphs

✍ Er Fang Shan; Li Ying Kang 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 212 KB

Strongly edge triangle regular graphs an

Strongly edge triangle regular graphs and a conjecture of Kotzig

✍ B.Radhakrishnan Nair; A. Vijayakumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 513 KB

The concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is stro

An infinite series of regular edge- but

An infinite series of regular edge- but not vertex-transitive graphs

✍ Felix Lazebnik; Raymond Viglione 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 1 views

## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 ≤ __n__ ≤ __q__−1, or __n__=2 and __q__ odd, we construct a connected __q__‐regular edge‐but not vertex‐transitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of

Finding dominating cliques efficiently,

Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

✍ Dieter Kratsch 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 914 KB

We study a new version of the domination problem in which the dominating set is required to be a clique. The minimum dominating clique problem is NP-complete for split graphs and, hence, for chordal graphs. We show that for two other important subclasses of chordal graphs the problem is solvable eff

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996