Almost rank three graphs

DOI10.1016/0012-365X(92)90317-9MaRDI QIDQ1195476zbMATH OpenFDO

Authors S. Singh

Publication date 6 December 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)90317-9

zbMATH Keywords

automorphism groupcotrianglefinite graphpair-symmetric graphranktriangle

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

A finite graph is pair-symmetric if its automorphism group acts transitively on four sets of ordered pairs of vertices: edges which lie in a triangle or in no triangle and non-edges which lie in a cotriangle or in no cotriangle. The author obtains necessary and sufficient conditions for a graph to be pair-symmetric and shows among other things that the automorphism group of a pair-symmetric graph nearly always has rank at most three.

Recommendations

• Separating rank 3 graphs
• Graphs with full rank 3-color matrix and few 3-colorings
• Mixed graphs with \(H\)-rank 3
• scientific article; zbMATH DE number 3399273
• scientific article; zbMATH DE number 3981205
• A classification of one-dimensional affine rank three graphs
• A structural result for 3-graphs
• scientific article; zbMATH DE number 1750097
• Rank 3 transitive decompositions of complete multipartite graphs
• scientific article; zbMATH DE number 1465768

Cites work

• A new 5‐arc‐transitive cubic graph
• Antipodal covering graphs
• Antipodal graphs of diameter three
• How many P-polynomial structures can an association scheme have?
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• The Graph Extension Theorem

Cited in

(2)

• Totally symmetric colored graphs
• scientific article; zbMATH DE number 3981205 (Why is no real title available?)

This page was built for publication: Almost rank three graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195476)