Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
VERTEX-TRANSITIVE NEUMAIER GRAPHS. |
| Συγγραφείς: |
JAZAERI, MOJTABA1 m.jazaeri@scu.ac.ir |
| Πηγή: |
Transactions on Combinatorics. Sep2026, Vol. 15 Issue 3, p203-214. 12p. |
| Θεματικοί όροι: |
*Regular graphs, *Cayley graphs, *Graph theory |
| Περίληψη: |
A graph G is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique C in G is called regular whenever for any vertex out of C, the number of its neighbors in C is independent of the vertex. A Neumaier graph is a non-complete edge-regular graph with a regular clique. In this paper, we study vertex-transitive Neumaier graphs. We give a necessary and sufficient condition under which a vertex-transitive Neumaier graph is strongly regular. We also identify Neumaier Cayley graphs with small valency at most 10 among vertex-transitive Neumaier graphs. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: |
Academic Search Index |