TITLE

THE VERTEX MONOPHONIC NUMBER OF A GRAPH

AUTHOR(S)
SANTHAKUMARAN, A. P.; TITUS, P.
PUB. DATE
May 2012
SOURCE
Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 2, p191
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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 mx(G). An x-monophonic set of cardinality mx(G) is called a mx-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 radmG = a, diammG = b and mx(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 mx(G) = n for some vertex x of G.
ACCESSION #
86440286

 

Related Articles

  • Global neighbourhood domination. S. V. Siva Rama Raju; I. H. Nagaraja Rao // Proyecciones - Journal of Mathematics;Mar2014, Vol. 33 Issue 1, p25 

    A subset of vertices of a graph is called a global neighbourhood dominating set(gnd - set) if is a dominating set for both and G and GN, where GNis the neighbourhood graph of G. The global neighbourhood domination number(gnd - number) is the minimum cardinality of a global neighbourhood...

  • On almost distance-transitive graphs. Guo, Wenbin; Makhnev, A.; Paduchikh, D. // Doklady Mathematics;Sep2013, Vol. 88 Issue 2, p581 

    The article focuses on the classification of antipodal almost distance-transitive graphs of diameter three. It states that a graph is considered as distance-transitive if the group is transitive on the vertex set. It mentions that if vertices were separated by a distance, the graph is called as...

  • PARTITIONING A GRAPH INTO A DOMINATING SET, A TOTAL DOMINATING SET, AND SOMETHING ELSE.  // Discussiones Mathematicae: Graph Theory;2010, Vol. 30 Issue 4, p563 

    No abstract available.

  • VERTEX RAINBOW COLORINGS OF GRAPHS. Fujie-Okamoto, Futaba; Kolasinski, Kyle; Jianwei Lin; Ping Zhang // Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 1, p63 

    In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G...

  • MATCHINGS AND TOTAL DOMINATION SUBDIVISION NUMBER IN GRAPHS WITH FEW INDUCED 4-CYCLES.  // Discussiones Mathematicae: Graph Theory;2010, Vol. 30 Issue 4, p611 

    No abstract available.

  • The Number of Independent Sets in a Graph with Small Maximum Degree. Galvin, David; Zhao, Yufei // Graphs & Combinatorics;Mar2011, Vol. 27 Issue 2, p177 

    Let ind( G) be the number of independent sets in a graph G. We show that if G has maximum degree at most 5 then (where d(�) is vertex degree, iso( G) is the number of isolated vertices in G and K is the complete bipartite graph with a vertices in one partition class and b in the other),...

  • Partitioning a graph into defensive k-alliances. Yero, Ismael; Bermudo, Sergio; Rodríguez-Velázquez, Juan; Sigarreta, José // Acta Mathematica Sinica;Jan2011, Vol. 27 Issue 1, p73 

    defensive k-alliance in a graph is a set S of vertices with the property that every vertex in S has at least k more neighbors in S than it has outside of S. A defensive k-alliance S is called global if it forms a dominating set. In this paper we study the problem of partitioning the vertex set...

  • Trees with Given Stability Number and Minimum Number of Stable Sets. Bruyère, Véronique; Joret, Gwenaël; Mélot, Hadrien // Graphs & Combinatorics;Mar2012, Vol. 28 Issue 2, p167 

    We study the structure of trees minimizing their number of stable sets for given order n and stability number α. Our main result is that the edges of a non-trivial extremal tree can be partitioned into n − α stars, each of size $${\lceil\frac{n-1}{n-\alpha}\rceil}$$ or...

  • On Strong(Weak) domination in Fuzzy graphs. Natarajan, C.; Ayyaswamy, S. K. // World Academy of Science, Engineering & Technology;Jul2010, Issue 43, p526 

    No abstract available.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics