Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) (Q403921): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A graph \(\Gamma\) is said to be edge-regular with parameters \((v,k,\lambda)\) if it is a regular graph of degree \(k\) on \(v\) vertices and each of its edges lies in \(\lambda\) triangles. \(\Gamma\) is called an amply regular graph with parameters \((v, k, \lambda, \mu)\) if it is an edge-regular graph with the corresponding parameters and any two vertices \(a\) and \(b\) with distance \(d(a,b)=2\) have exactly \(\mu\) common neighbors. An amply regular graph of diameter 2 is said to be strongly regular. The point graph of an \(\alpha\)-partial geometry of order \((s,t)\), denoted by \(pG_{\alpha}(s,t)\), is defined on the set of points, and two points are adjacent if they lie on a line; it is strongly regular. Such a strongly regular graph for some positive integers \(\alpha\), \(s\), and \(t\) is called a pseudogeometric graph for \(pG_{\alpha}(s, t)\). The main result of this paper is the following: Let \(\Gamma\) be an amply regular graph whose subgraphs induced by the neighborhoods of all vertices are pseudogeometric graphs for \(pG_{s-3}(s, t)\). Then one of the following assertions holds: (1) \(\Gamma\) is a strongly regular graph, (2) the diameter of \(\Gamma\) is 3, (3) the diameter of \(\Gamma\) is greater than 3 and either \(s=4\) or \(s=5\) and \(t\leq 6\). | |||
Property / review text: A graph \(\Gamma\) is said to be edge-regular with parameters \((v,k,\lambda)\) if it is a regular graph of degree \(k\) on \(v\) vertices and each of its edges lies in \(\lambda\) triangles. \(\Gamma\) is called an amply regular graph with parameters \((v, k, \lambda, \mu)\) if it is an edge-regular graph with the corresponding parameters and any two vertices \(a\) and \(b\) with distance \(d(a,b)=2\) have exactly \(\mu\) common neighbors. An amply regular graph of diameter 2 is said to be strongly regular. The point graph of an \(\alpha\)-partial geometry of order \((s,t)\), denoted by \(pG_{\alpha}(s,t)\), is defined on the set of points, and two points are adjacent if they lie on a line; it is strongly regular. Such a strongly regular graph for some positive integers \(\alpha\), \(s\), and \(t\) is called a pseudogeometric graph for \(pG_{\alpha}(s, t)\). The main result of this paper is the following: Let \(\Gamma\) be an amply regular graph whose subgraphs induced by the neighborhoods of all vertices are pseudogeometric graphs for \(pG_{s-3}(s, t)\). Then one of the following assertions holds: (1) \(\Gamma\) is a strongly regular graph, (2) the diameter of \(\Gamma\) is 3, (3) the diameter of \(\Gamma\) is greater than 3 and either \(s=4\) or \(s=5\) and \(t\leq 6\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ioan Tomescu / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6336265 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
amply regular graph | |||
Property / zbMATH Keywords: amply regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
edge-regular graph | |||
Property / zbMATH Keywords: edge-regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strongly regular graph | |||
Property / zbMATH Keywords: strongly regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pseudogeometric graph | |||
Property / zbMATH Keywords: pseudogeometric graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
distance-regular graph | |||
Property / zbMATH Keywords: distance-regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Johnson graph | |||
Property / zbMATH Keywords: Johnson graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Taylor graph | |||
Property / zbMATH Keywords: Taylor graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
intersection array | |||
Property / zbMATH Keywords: intersection array / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spectrum | |||
Property / zbMATH Keywords: spectrum / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Terwilliger's theorem | |||
Property / zbMATH Keywords: Terwilliger's theorem / rank | |||
Normal rank |
Revision as of 17:00, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) |
scientific article |
Statements
Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) (English)
0 references
29 August 2014
0 references
A graph \(\Gamma\) is said to be edge-regular with parameters \((v,k,\lambda)\) if it is a regular graph of degree \(k\) on \(v\) vertices and each of its edges lies in \(\lambda\) triangles. \(\Gamma\) is called an amply regular graph with parameters \((v, k, \lambda, \mu)\) if it is an edge-regular graph with the corresponding parameters and any two vertices \(a\) and \(b\) with distance \(d(a,b)=2\) have exactly \(\mu\) common neighbors. An amply regular graph of diameter 2 is said to be strongly regular. The point graph of an \(\alpha\)-partial geometry of order \((s,t)\), denoted by \(pG_{\alpha}(s,t)\), is defined on the set of points, and two points are adjacent if they lie on a line; it is strongly regular. Such a strongly regular graph for some positive integers \(\alpha\), \(s\), and \(t\) is called a pseudogeometric graph for \(pG_{\alpha}(s, t)\). The main result of this paper is the following: Let \(\Gamma\) be an amply regular graph whose subgraphs induced by the neighborhoods of all vertices are pseudogeometric graphs for \(pG_{s-3}(s, t)\). Then one of the following assertions holds: (1) \(\Gamma\) is a strongly regular graph, (2) the diameter of \(\Gamma\) is 3, (3) the diameter of \(\Gamma\) is greater than 3 and either \(s=4\) or \(s=5\) and \(t\leq 6\).
0 references
amply regular graph
0 references
edge-regular graph
0 references
strongly regular graph
0 references
pseudogeometric graph
0 references
distance-regular graph
0 references
Johnson graph
0 references
Taylor graph
0 references
intersection array
0 references
spectrum
0 references
Terwilliger's theorem
0 references