Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The cobondage number of a graph

100%

Kulli V., Janakiram B.

Discussiones Mathematicae Graph Theory

1996

tom 16

nr 2

111-117

A set D of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V-D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. We define the cobondage number $b_c(G)$ of G to be the minimum cardinality among the sets of edges X ⊆ P₂(V) - E, where P₂(V) = {X ⊆ V:|X| = 2} such that γ(G+X) < γ(G). In this paper, the exact values of b_c(G) for some standard graphs are found and some bounds are obtained. Also, a Nordhaus-Gaddum type result is established.

Characterizations of planar plick graphs

100%

Kulli V., Basavanagoud B.

Discussiones Mathematicae Graph Theory

2004

tom 24

nr 1

41-45

In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Kulli V.

1 Basavanagoud B.

1 Janakiram B.

1 2004

1 1996

Wyniki wyszukiwania

The cobondage number of a graph

Characterizations of planar plick graphs