Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs

Matan Ziv-Av ()
Additional contact information
Matan Ziv-Av: Ben-Gurion University of the Negev, Department of Mathematics

A chapter in Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009, pp 297-311 from Springer

Abstract: Summary In this chapter we introduce the notion of total graph coherent configuration, and use computer tools to investigate it for two classes of strongly regular graphs – the triangular graphs T(n) and the lattice square graphs L 2(n). For T(n), we show that its total graph coherent configuration has exceptional mergings only in the cases n=5 and n=7.

Keywords: Triangular graph; Lattice square graph; Total graph coherent closure; Coherent subalgebra (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-01960-9_12

Ordering information: This item can be ordered from
http://www.springer.com/9783642019609

DOI: 10.1007/978-3-642-01960-9_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().