Research Article

The Connected Open Monophonic Number of a Graph

by  A. P. Santhakumaran, M. Mahendran
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 80 - Issue 1
Published: October 2013
Authors: A. P. Santhakumaran, M. Mahendran
10.5120/13828-1627
PDF

A. P. Santhakumaran, M. Mahendran . The Connected Open Monophonic Number of a Graph. International Journal of Computer Applications. 80, 1 (October 2013), 39-42. DOI=10.5120/13828-1627

                        @article{ 10.5120/13828-1627,
                        author  = { A. P. Santhakumaran,M. Mahendran },
                        title   = { The Connected Open Monophonic Number of a Graph },
                        journal = { International Journal of Computer Applications },
                        year    = { 2013 },
                        volume  = { 80 },
                        number  = { 1 },
                        pages   = { 39-42 },
                        doi     = { 10.5120/13828-1627 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2013
                        %A A. P. Santhakumaran
                        %A M. Mahendran
                        %T The Connected Open Monophonic Number of a Graph%T 
                        %J International Journal of Computer Applications
                        %V 80
                        %N 1
                        %P 39-42
                        %R 10.5120/13828-1627
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we introduce and investigate the connected open monophonic sets and related parameters. For a connected graph G of order n, a subset S of vertices of G is a monophonic set of G if each vertex v in G lies on a x-y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A monophonic set of cardinality m(G) is called a m–set of G. A set S of vertices of a connected graph G is an open monophonic set of G if for each vertex v in G, either v is an extreme vertex of G and v ? S, or v is an internal vertex of a x-y monophonic path for some x, y ? S. An open monophonic set of minimum cardinality is a minimum open monophonic set and this cardinality is the open monophonic number, om(G). A connected open monophonic set of G is an open monophonic set S such that the subgraph < S > induced by S is connected. The minimum cardinality of a connected open monophonic set of G is the connected open monophonic number, omc(G). Certain general properties satisfied by connected open monophonic sets are investigated. The connected open monophonic numbers of certain standard graphs are determined. A necessary condition for the connected open monophonic number of a graph G of order n to be n is determined. A graph with connected open monophonic number 2 is characterized. It is proved that for any k, n of integers with 3 ? k ? n, there exists a connected graph G of order n such that omc(G) = k.

References
  • F. Buckley and F. Harary, Distance in graphs, Addison-Wesley, Redwood city, CA, 1990.
  • G. Chartrand, E. M. Palmer and P. Zhang, The geodetic number of a graph: A survey, Congr. Numer. , 156 (2002), 37-58.
  • G. Chartrand, F. Harary, H. C. Swart and P. Zhang, Geodomination in graphs, Bulletin of the ICA, 31(2001), 51-59.
  • F. Harary, Graph Theory, Addison-Wesley, 1969.
  • R. Muntean and P. Zhang, On geodomination in graphs, Congr. Numer. , 143(2000), 161-174.
  • P. A. Ostrand, Graphs with specified radius and diameter, Discrete Math. , 4(1973), 71-75.
  • A. P. Santhakumaran and T. Kumari Latha, On the open geodetic number of a graph, SCIENTIA Series A: Mathematical Sciences, Vol. 20(2010), 131-142.
  • A. P. Santhakumaran and M. Mahendran, The open monophonic number of a graph, Communicated.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Distance monophonic path monophonic number open monophonic number connected open monophonic number.

Powered by PhDFocusTM