The isodominism class of the graphs

DOI10.1142/S1793830921500300MaRDI QIDQ5013477zbMATH OpenOpenAlexFDO

Authors B. Tolue, Amin Rafiei

Publication date 30 November 2021

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830921500300

zbMATH Keywords

dominating setgraph isomorphismquotient graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Graphs with equal domination and independent domination number
• Isomorphism checking of \(I\)-graphs
• scientific article; zbMATH DE number 89183
• Edge-distance between isomorphism classes of graphs
• Isolate and independent domination number of some classes of graphs

Cites work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• High quality graph partitioning
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)

Cited in

(1)

• scientific article; zbMATH DE number 889957 (Why is no real title available?)

This page was built for publication: The isodominism class of the graphs

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