The domination and independence of some cubic bipartite graphs
From MaRDI portal
Publication:3097145
zbMATH Open1231.05206MaRDI QIDQ3097145FDOQ3097145
Authors: N. Murugesan, Deepa S. Nair
Publication date: 15 November 2011
Full work available at URL: http://www.m-hikari.com/ijcms-2011/13-16-2011/index.html
Recommendations
- The inverse domination number and independence number of some cubic bipartite graphs
- Independent domination in subcubic bipartite graphs of girth at least six
- Domination versus independent domination in cubic graphs
- Independent domination in bipartite cubic graphs
- What is the difference between the domination and independent domination numbers of a cubic graph?
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (7)
- The inverse domination number and independence number of some cubic bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Independent domination in bipartite cubic graphs
- On independent domination in planar cubic graphs
- (1, 2)-DOUBLE DOMINATION IN GRAPHS
This page was built for publication: The domination and independence of some cubic bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097145)