Friendship decompositions of graphs

DOI10.1016/J.DISC.2007.06.042MaRDI QIDQ932609zbMATH OpenOpenAlexFDO

Authors Teresa Sousa

Publication date 11 July 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.06.042

zbMATH Keywords

friendship decompositiongraph decompositon

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Greedy friendship decompositions of graphs
• The maximum spectral radius of graphs without friendship subgraphs
• Graphic sequences with a realization containing a generalized friendship graph
• scientific article; zbMATH DE number 3989375
• Induced decompositions of graphs

Cites work

• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• On a problem of G. O. H. Katona and T. Tarján
• Parallel concepts in graph theory
• The Representation of a Graph by Set Intersections

Cited in

(6)

• Greedy friendship decompositions of graphs
• On the domination polynomials of friendship graphs
• Friendship-Like Graphs and It’s Classiffication
• scientific article; zbMATH DE number 6736246 (Why is no real title available?)
• scientific article; zbMATH DE number 6930592 (Why is no real title available?)
• Friendship destroys orderability via clustering pseudogaps

This page was built for publication: Friendship decompositions of graphs

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