Amply regular graphs whose local subgraphs are pseudogeometric graphs for \(pG_{s - 3}(s, t)\) (Q403921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q173980 / rank
Normal rank
 
Property / author
 
Property / author: Aleksandr Alekseevich Makhnev / rank
 
Normal rank
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs in which the neighborhood of each vertex is the complementary graph of a Seidel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular extensions of strongly regular graphs with eigenvalue 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly regular graphs with eigenvalue 3 and their extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4416186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:58, 8 July 2024

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
    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

    Identifiers