Strong independence and strong vertex covering in semigraphs

D. K Thakkar, Ashish Amrutlal Prajapati


In this paper we study the effect of removing a vertex from the semigraph on strong vertex covering number and strong independence number. Also we prove that the strong vertex covering number does not increase when a vertex is removed from the semigraph.

Full Text:



E. Sampathkumarachar “Semigraphs and their Applications†“ Report on the DST (Department of Science and Technology) submitted to DST, India, May 2000.

S. S. Kamath and R. S. Bhat, Domination in semigraphs, Reprint submitted to Elsevier Science, 12 September (2003)

Shyam S. Kamath, Saroja R. Hebber and RavishankarBhat Domination in Semigraph (Part-I) Lecture Notes National Workshop on Semigraphs, June 04-07, 2010.

T. W. Haynes, S. t. Hedetniemi and P. J. Slater, Fundamental Domination In Graphs, Marcel Dekker, Inc, (1998)

T. W. Haynes, S. t. Hedetniemi and P. J. Slater, Domination In Graphs Advanced Topics, Marcel Dekker, Inc, (1998)


  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.