Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
From MaRDI portal
Publication:1309472
DOI10.1016/0012-365X(93)90553-6zbMath0784.05038MaRDI QIDQ1309472
Publication date: 20 December 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items
On unique minimum dominating sets in some Cartesian product graphs ⋮ Complexity and characterization aspects of edge-related domination for graphs ⋮ Covering the edges of a graph by three odd subgraphs ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Unique irredundance, domination and independent domination in graphs ⋮ Unique minimum semipaired dominating sets in trees
Cites Work
- Unnamed Item
- On domination and independent domination numbers of a graph
- Graphs with unique maximum independent sets
- On graphs with equal domination and independent domination numbers
- Parallel concepts in graph theory
- On unique independent sets in graphs
- On the 1-factors of n-connected graphs
- A graph polynomial and its applications
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Edge Dominating Sets in Graphs
- On the 1-factors of a non-separable graph
