Graph shadows and edge-regular graphs
Combinatorics
2025-04-14 v1
Abstract
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than that of the strongly regular. In [1], a few methods of constructing new graphs from old are of use. One of these is the unary "graph shadow" operation. Here, this operation is generalized, and then generalized again, and conditions are given under which application of the new operations to edge-regular graphs result in edge-regular graphs. Also, some attention to strongly regular graphs is given.
Cite
@article{arxiv.2504.08587,
title = {Graph shadows and edge-regular graphs},
author = {Jared DeLeo},
journal= {arXiv preprint arXiv:2504.08587},
year = {2025}
}
Comments
14 pages, 6 figures