scientific article
From MaRDI portal
Publication:3015634
zbMath1231.05197MaRDI QIDQ3015634
Craig E. Larson, Ermelinda DeLaViña, Ryan Pepper, Bill Waller
Publication date: 13 July 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independence numbermatching numberpath covering numberneighborhoods2-domination number\(k\)-independence number\(k\)-domination numbercore size
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
A note on the annihilation number and 2-domination number of a tree ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ Bounds on the \(k\)-domination number of a graph ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Graffiti.pc ⋮ Locating-dominating sets: from graphs to oriented graphs
This page was built for publication:
