Near threshold graphs.
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ghorbani, Ebrahim, Koolen, Jack H., Yang, Jae Young (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vladimir Samodivkin (2008)
Discussiones Mathematicae Graph Theory
Similarity:
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every vertex of the graph is either in D or is adjacent to a member of D. Any dominating set D of a graph G with |D| = γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-good if x belongs to some γ-set and (ii) γ-bad if x belongs to no γ-set. The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph...
Das, K.Ch. (2005)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
Le Anh Vinh (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: