Unicyclic graphs with equal domination and complementary tree domination numbers
DOI10.4067/S0716-09172016000300002zbMATH Open1431.05113OpenAlexW2519849975MaRDI QIDQ4604430FDOQ4604430
Authors: Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan 
Publication date: 26 February 2018
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4067/s0716-09172016000300002
Recommendations
- Unicyclic graphs with equal total and total outer-connected domination numbers.
- scientific article; zbMATH DE number 60247
- Trees and unicyclic graphs with large fair domination number
- On trees and unicyclic graphs with equal forcing-type numbers
- scientific article; zbMATH DE number 5543124
- Graphs and their complements with equal total domination numbers
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- On the \(k\)-hop domination numbers of spanning trees of unicyclic graphs
- On domination multisubdivision number of unicyclic graphs
- On arbitraly vertex decomposable unicyclic graphs with dominating cycle
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs
- The limit case of a domination property
- On some formulas in combinatorial computation of uni-trivalent graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On arbitraly vertex decomposable unicyclic graphs with dominating cycle
- Cactus graphs with equal domination and complementary tree domination numbers.
This page was built for publication: Unicyclic graphs with equal domination and complementary tree domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604430)
