A graph and its complement with specified properties. IV. Counting self-complementary blocks

DOI10.1002/JGT.3190050108MaRDI QIDQ3050460zbMATH OpenOpenAlexFDO

Authors Jin Akiyama, Frank Harary

Publication date 1981

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/143656

zbMATH Keywords

counting self-complementary blocks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Cites work

• Self-Complementary Generalized Orbits of a Permutation Group

Cited in

(9)

• Sum graphs over all the integers
• Restrained domination in self-complementary graphs
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Graphs whose complement and square are isomorphic
• A note on graph and its complement with specified properties: radius, diameter, center, and periphery
• A study on distance in graph complement
• CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs
• The complement problem for linklessly embeddable graphs
• Dually vertex-oblique graphs

This page was built for publication: A graph and its complement with specified properties. IV. Counting self-complementary blocks

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