Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs

Matan Ziv-Av

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

Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs

Matan Ziv-Av

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

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₂(n). For T(n), we show that its total graph coherent configuration has exceptional mergings only in the cases n=5 and n=7.

Original language	English
Title of host publication	Algorithmic Algebraic Combinatorics and Gröbner Bases
Publisher	Springer Berlin Heidelberg
Pages	297-311
Number of pages	15
ISBN (Print)	9783642019593
DOIs	https://doi.org/10.1007/978-3-642-01960-9_12
State	Published - 1 Dec 2009

Keywords

Coherent subalgebra
Lattice square graph
Total graph coherent closure
Triangular graph

ASJC Scopus subject areas

General Mathematics

Access to Document

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

Cite this

@inbook{422b606191e54eeb9b21d17b3661cf86,

title = "Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs",

abstract = "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 L2(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 = "Coherent subalgebra, Lattice square graph, Total graph coherent closure, Triangular graph",

author = "Matan Ziv-Av",

year = "2009",

month = dec,

day = "1",

doi = "10.1007/978-3-642-01960-9_12",

language = "English",

isbn = "9783642019593",

pages = "297--311",

booktitle = "Algorithmic Algebraic Combinatorics and Gr{\"o}bner Bases",

publisher = "Springer Berlin Heidelberg",

}

TY - CHAP

T1 - Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs

AU - Ziv-Av, Matan

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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 L2(n). For T(n), we show that its total graph coherent configuration has exceptional mergings only in the cases n=5 and n=7.

AB - 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 L2(n). For T(n), we show that its total graph coherent configuration has exceptional mergings only in the cases n=5 and n=7.

KW - Coherent subalgebra

KW - Lattice square graph

KW - Total graph coherent closure

KW - Triangular graph

UR - http://www.scopus.com/inward/record.url?scp=84885713138&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01960-9_12

DO - 10.1007/978-3-642-01960-9_12

M3 - Chapter

AN - SCOPUS:84885713138

SN - 9783642019593

SP - 297

EP - 311

BT - Algorithmic Algebraic Combinatorics and Gröbner Bases

PB - Springer Berlin Heidelberg

ER -

Computer aided investigation of total graph coherent configurations for two infinite families of classical strongly regular graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this