Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: vertex monophonic number

Sortuj według:

Ogranicz wyniki do:

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

The vertex monophonic number of a graph

100%

Santhakumaran A., Titus P.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 2

191-204

For a connected graph G of order p ≥ 2 and a vertex x of G, a set S ⊆ V(G) is an x-monophonic set of G if each vertex v ∈ V(G) lies on an x -y monophonic path for some element y in S. The minimum cardinality of an x-monophonic set of G is defined as the x-monophonic number of G, denoted by mₓ(G). An x-monophonic set of cardinality mₓ(G) is called a mₓ-set of G. We determine bounds for it and characterize graphs which realize these bounds. A connected graph of order p with vertex monophonic numbers either p - 1 or p - 2 for every vertex is characterized. It is shown that for positive integers a, b and n ≥ 2 with 2 ≤ a ≤ b, there exists a connected graph G with radₘG = a, diamₘG = b and mₓ(G) = n for some vertex x in G. Also, it is shown that for each triple m, n and p of integers with 1 ≤ n ≤ p -m -1 and m ≥ 3, there is a connected graph G of order p, monophonic diameter m and mₓ(G) = n for some vertex x of G.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Santhakumaran A.

1 Titus P.

1 2012

Wyniki wyszukiwania

The vertex monophonic number of a graph