Friendship two-graphs

DOI10.1007/S00373-010-0914-0MaRDI QIDQ604993zbMATH OpenOpenAlexWikidataFDO

Authors Endre Boros, Vladimir Gurvich, I.È. Zverovich

Publication date 12 November 2010

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0914-0

zbMATH Keywords

matrix equationfriendship graphsfriendship two-graphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The Friendship Theorem
• Infinite generalized friendship graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• scientific article; zbMATH DE number 6930592
• The Friendship Theorem

Cites work

• scientific article; zbMATH DE number 3974977 (Why is no real title available?)
• scientific article; zbMATH DE number 4112636 (Why is no real title available?)
• Combinatorial designs related to the strong perfect graph conjecture
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Vertex- and edge-minimal and locally minimal graphs

Cited in

(6)

• Friending
• Friendship-Like Graphs and It’s Classiffication
• Balanced and strongly balanced friendship graph systems
• Graphs, friends and acquaintances
• scientific article; zbMATH DE number 6736246 (Why is no real title available?)
• Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners

This page was built for publication: Friendship two-graphs

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