Domination integrity of middle graphs
From MaRDI portal
Recommendations
Cited in
(20)- On cd-coloring of trees and co-bipartite graphs
- On the domination integrity
- Domination integrity of some graph classes
- On the complexity of minimum \(q\)-domination partization problems
- Strong Domination integrity of shadow graphs of some graphs
- Domination number of middle graphs
- The cd-coloring of graphs
- Domination integrity of splitting and degree splitting graphs of some graphs
- Paired domination integrity of graphs
- On the complexity of cd-coloring of graphs
- Domination integrity of line splitting graph and central graph of path, cycle and star graphs
- Vulnerability analysis of comb product of graphs and related applications in chemical structures
- TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS
- Domination-related parameters in middle graphs
- Domination integrity of splitting graph of path and cycle
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
- Domination integrity of some new graphs
- Approximation algorithm for minimum \(q\)-dominator partization problem
- On CD-chromatic number and its lower bound in some classes of graphs
- The middle dominating graph of a graph
This page was built for publication: Domination integrity of middle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998643)
