A graph and its complement with specified properties. IV. Counting self-complementary blocks
From MaRDI portal
Publication:3050460
DOI10.1002/jgt.3190050108zbMath0415.05041OpenAlexW2014334849MaRDI QIDQ3050460
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
Related Items (9)
CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs ⋮ The complement problem for linklessly embeddable graphs ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Dually vertex-oblique graphs ⋮ Graphs whose complement and square are isomorphic ⋮ Restrained domination in self-complementary graphs ⋮ A note on graph and its complement with specified properties: Radius, diameter, center, and periphery ⋮ A study on distance in graph complement ⋮ Sum graphs over all the integers
Cites Work
This page was built for publication: A graph and its complement with specified properties. IV. Counting self-complementary blocks
