-saturated graphs of minimum size
Zsolt Tuza (1989)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Even bonds of prescribed directed parity.”
-saturated graphs of minimum size
The graph of labellings of a given graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity:
On the doubly connected domination number of a graph
Joanna Cyman, Magdalena Lemańska, Joanna Raczek (2006)
Open Mathematics
Similarity:
For a given connected graph G = (V, E), a set is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number. We investigate several properties of doubly connected dominating sets and give some bounds on the doubly connected domination number.
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Elongation in a graph
Bohdan Zelinka (1982)
Mathematica Slovaca
Similarity: