Monophonic numbers of the join and composition of connected graphs

@article{Paluga2007MonophonicNO,
  title={Monophonic numbers of the join and composition of connected graphs},
  author={E. M. Paluga and Sergio R. Canoy},
  journal={Discret. Math.},
  year={2007},
  volume={307},
  pages={1146-1154}
}
In this paper, we describe the monophonic sets in the join and composition of two connected graphs. We also determine the monophonic numbers of the join of any two connected graphs and the composition G[K"n] of a connected graph G and the complete graph K"n. Lower and upper bounds are obtained for the monophonic number of the composition G[H], where G is connected and H is a connected non-complete graph. 
21 Citations

Figures and Topics from this paper

THE UPPER CONNECTED EDGE MONOPHONIC NUMBER OF A GRAPH
Doubly Monophonic Number of a Graph
  • PDF
The Connected Monophonic Number of a Graph
  • 3
The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph ∗ KrishnaPillai
  • 1
  • PDF
• THE EDGE –TO–VERTEX MONOPHONIC NUMBER OF A GRAPH
  • 3
THE FORCING MONOPHONIC NUMBER OF A GRAPH
  • 5
...
1
2
3
...

References

SHOWING 1-10 OF 13 REFERENCES
The Steiner number of a graph
  • 51
  • PDF
On the Steiner, geodetic and hull numbers of graphs
  • 75
  • PDF
On the geodetic number of a graph
  • 126
Geodetic sets in graphs
  • 55
Geodetic sets in graphs , Discuss
  • Math . Graph Theory
  • 2006
On the Geodetic Covers and Geodetic Bases of the Composition G[Km]
  • 6
Minimal path convexity under some graph operations , Util
  • 2005
On the Steiner
  • geodetic and hull numbers of graphs, Discrete Math. 293
  • 2005
Cagaanan, On the geodesic and hull numbers of the sum of graphs
  • Congr. Numer
  • 2003
...
1
2
...