From Surf Wiki (app.surf) — the open knowledge base

Gewirtz graph

Field	Value
name	Gewirtz graph
image	[[Image:Gewirtz graph embeddings.svg	300px]]
image_caption	Some embeddings with 7-fold symmetry. No 8-fold or 14-fold symmetry is possible.
vertices	56
edges	280
automorphisms
radius	2
diameter	2
girth	4
chromatic_number	4
properties	Strongly regular
Hamiltonian
Triangle-free
Vertex-transitive
Edge-transitive
Distance-transitive.

Hamiltonian Triangle-free Vertex-transitive Edge-transitive Distance-transitive.

The Gewirtz graph is a strongly regular graph with 56 vertices and valency 10. It is named after the mathematician Allan Gewirtz, who described the graph in his dissertation.

Construction

The Gewirtz graph can be constructed as follows. Consider the unique S(3, 6, 22) Steiner system, with 22 elements and 77 blocks. Choose a random element, and let the vertices be the 56 blocks not containing it. Two blocks are adjacent when they are disjoint.

With this construction, one can embed the Gewirtz graph in the Higman–Sims graph.

Properties

The characteristic polynomial of the Gewirtz graph is

: (x-10)(x-2)^{35}(x+4)^{20}. ,

Therefore, it is an integral graph.

The Gewirtz graph is also determined by its spectrum.

The independence number is 16.

Notes

References

[http://genealogy.math.ndsu.nodak.edu/id.php?id=35587 Allan Gewirtz], ''Graphs with Maximal Even Girth'', Ph.D. Dissertation in Mathematics, City University of New York, 1967.

Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

individual-graphs regular-graphs strongly-regular-graphs

Want to explore this topic further?

Ask Mako anything about Gewirtz graph — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report