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 “Bi-Induced Subgraphs and Stability Number”

Superstable graphs

Heinrich Herre, Allan Mekler, Kenneth Smith (1983)

Fundamenta Mathematicae

Similarity:

k-independence stable graphs upon edge removal

Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let k be a positive integer and G = (V(G),E(G)) a graph. A subset S of V(G) is a k-independent set of G if the subgraph induced by the vertices of S has maximum degree at most k-1. The maximum cardinality of a k-independent set of G is the k-independence number βₖ(G). A graph G is called β¯ₖ-stable if βₖ(G-e) = βₖ(G) for every edge e of E(G). First we give a necessary and sufficient condition for β¯ₖ-stable graphs. Then we establish four equivalent conditions for β¯ₖ-stable trees. ...

On Minimum (Kq, K) Stable Graphs

J.L. Fouquet, H. Thuillier, J.M. Vanherpe, A.P. Wojda (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k vertices (k ≥ 0). Andrzej ˙ Zak in the paper On (Kq; k)-stable graphs, ( doi:/10.1002/jgt.21705) has proved a conjecture of Dudek, Szyma´nski and Zwonek stating that for sufficiently large k the number of edges of a minimum (Kq, k) stable graph is (2q − 3)(k + 1) and that such a graph is isomorphic to sK2q−2 + tK2q−3 where s and t are integers such that s(q − 1) + t(q − 2) − 1 = k. We have...

On H -closed graphs

Pavel Tomasta, Eliška Tomová (1988)

Czechoslovak Mathematical Journal

Similarity:

On the Number ofα-Labeled Graphs

Christian Barrientos, Sarah Minion (2018)

Discussiones Mathematicae Graph Theory

Similarity:

When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research area. Here we use an extension of the adjacency matrix to count and classify α-labeled graphs according to their size, order, and boundary value.

On The Roman Domination Stable Graphs

Majid Hajian, Nader Jafari Rad (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A Roman dominating function (or just RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = Pu2V (G) f(u). The Roman domination number of a graph G, denoted by R(G), is the minimum weight of a Roman dominating function on G. A graph G is Roman domination stable if the Roman domination number of G remains unchanged under...

Stable graphs

Klaus-Peter Podewski, Martin Ziegler (1978)

Fundamenta Mathematicae

Similarity: