Graffiti.pc
From MaRDI portal
Software:19205
swMATH7152MaRDI QIDQ19205FDOQ19205
Author name not available (Why is that?)
Cited In (15)
- Relating the annihilation number and the 2-domination number of a tree
- Spanning paths in graphs
- A classification of cactus graphs according to their total domination number
- Lower bounds on the total domination number of a graph
- On total domination and support vertices of a tree
- A survey of selected recent results on total domination in graphs
- On spanning cycles, paths and trees
- A note on dominating sets and average distance
- Graphs with equal independence and annihilation numbers
- Total domination versus domination in cubic graphs
- On upper total domination versus upper domination in graphs
- Minimum degree, leaf number and traceability
- Title not available (Why is that?)
- Minimum Degree, Leaf Number, and Hamiltonicity
- Leaf number and Hamiltonian \(C_4\)-free graphs
This page was built for software: Graffiti.pc
