A measure of graph vulnerability: Scattering number.

Kirlangiç, Alpay

Displaying similar documents to “A measure of graph vulnerability: Scattering number.”

The integer sequence A002620 and upper antagonistic functions.

Speed, Sam E. (2003)

Journal of Integer Sequences [electronic only]

Similarity:

A result on $(g, f, n)$ -critical graphs.

Zhou, Sizhong (2009)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

On degree sets and the minimum orders in bipartite graphs

Y. Manoussakis, H.P. Patil (2014)

Discussiones Mathematicae Graph Theory

Similarity:

For any simple graph G, let D(G) denote the degree set {degG(v) : v ∈ V (G)}. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further obtain the graphs of minimum orders in such families. More general, for a given pair (S, T) of finite, nonempty sets of positive integers of the same cardinality, it is shown that there exists a bipartite graph B(X, Y ) such that D(X)...