On domination numbers of graphs bundles
From MaRDI portal
Publication:854408
DOI10.1007/BF02896459zbMath1110.05079MaRDI QIDQ854408
Publication date: 4 December 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
On the watching number of graphs using discharging procedure ⋮ On strong graph bundles ⋮ Graph bundles and Ricci‐flatness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unit disk graphs
- Associative products of graphs
- Characteristic polynomials of some weighted graph bundles and its application to links
- Unique square property and fundamental factorizations of graph bundles
- Recognizing Cartesian graph bundles
- An inequality related to Vizing's conjecture
- Algorithm for recognizing Cartesian graph bundles
- The chromatic numbers of graph bundles over cycles
- Dominating Cartesian products of cycles
- Algebraic approach to fasciagraphs and rotagraphs
- An algorithm forK-convex closure and an application
- On Vizing's conjecture
- On the domination of the products of graphs II: Trees
- Caracteristics polynomials of some grap bundlesII
- Coloring graph bundles
- Recognizing weighted directed cartesian graph bundles
- The domination numbers of the 5 × n and 6 × n grid graphs
- Isomorphism Classes of Graph Bundles
- On recognizing Cartesian graph bundles
This page was built for publication: On domination numbers of graphs bundles
