RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2010 Volume 16, Number 3, Pages 78–87 (Mi timm577)

This article is cited in 5 papers

On automorphisms of 4-isoregular graphs

A. H. Zhurtova, A. A. Makhnevb, M. S. Nirovaa

a Kabardino-Balkar State University
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences

Abstract: Graph $\Gamma$ is called t-isoregular, if for each $i\le t$ the number of common neighbours of $i$-vertex subgraph $\Delta$ depends only on the isomorphism type of $\Delta$. It is known that 4-isoregular graph is a regular complete multipartite graph, pentagon, $3\times3$-grid or pseudo-geometric graph for for $pG_r(2r,(2r-1)(r+1)^2)$ (or the complement of such a graph). In this paper it is obtained formulas for the character values of automorphisms of strongly regular subgraphs of pseudo-geometric graph $\Gamma$ for $pG_r(2r,(2r-1)(r+1)^2)$. It is investigated the case, when a subgraph of fixed points of automorphism of prime order of $\Gamma$ is empty, clique or coclique.

Keywords: strongly regular graph, automorphism of graph.

UDC: 519.17+512.54

Received: 25.12.2009



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025