A graph and its complement with specified properties. I: Connectivity

DOI10.1155/S016117127900020XMaRDI QIDQ1258310zbMATH OpenOpenAlexFDO

Authors Jin Akiyama, Frank Harary

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

zbMATH Keywords

ComplementGraphs

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Cited in

(15)

• On conflict-free connection of graphs
• Coherent network partitions
• Generalizing cographs to 2-cographs
• Coherent network partitions: characterizations with cographs and prime graphs
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Structural properties of word representable graphs
• -chromatic partition in planar graph characterization
• Nordhaus-Gaddum type results for the Harary index of graphs
• Characterizing 2-distance graphs
• A note on graph and its complement with specified properties: radius, diameter, center, and periphery
• A study on distance in graph complement
• A polynomial time algorithm for geodetic hull number for complementary prisms
• The complement problem for linklessly embeddable graphs
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• Complementary _1-graphs and related combinatorial structures

This page was built for publication: A graph and its complement with specified properties. I: Connectivity

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