Orbit polynomial graphs of prime order

DOI10.1016/0012-365X(87)90023-9zbMath0642.05028MaRDI QIDQ1101127

Robert A. Beezer

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency algebradistance- transitive graphsdistance regulardistance-polynomialorbit polynomial graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Algebraic systems of matrices (15A30)

Related Items (3)

Quotient-polynomial graphs ⋮ A disrespectful polynomial ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
• Trivalent orbit polynomial graphs
• The group and the minimal polynomial of a graph
• Characterization of H(n,q) by the parameters
• On distance-regularity in graphs
• Point-symmetric graphs with a prime number of points
• On the Classification of Symmetric Graphs with a Prime Number of Vertices
• An algebraic characterization of symmetric graphs with a prime number of vertices
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Orbit polynomial graphs of prime order