A graph and its complement with specified properties. I: Connectivity
From MaRDI portal
Publication:1258310
DOI10.1155/S016117127900020XzbMath0408.05037OpenAlexW2087952350MaRDI QIDQ1258310
Publication date: 1979
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44791
Related Items (14)
A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ The complement problem for linklessly embeddable graphs ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Structural properties of word representable graphs ⋮ Characterizing 2-distance graphs ⋮ On conflict-free connection of graphs ⋮ γ-Chromatic Partition in Planar Graph Characterization ⋮ A note on graph and its complement with specified properties: Radius, diameter, center, and periphery ⋮ Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs ⋮ Coherent network partitions: characterizations with cographs and prime graphs ⋮ Coherent network partitions ⋮ Nordhaus-Gaddum Type results for the Harary index of graphs ⋮ A study on distance in graph complement ⋮ Generalizing cographs to 2-cographs
This page was built for publication: A graph and its complement with specified properties. I: Connectivity
