Submit Paper

Article Processing Fee

Pay Online

           

Crossref logo

  DOI Prefix   10.20431


 

International Journal of Scientific and Innovative Mathematical Research
Volume 5, Issue 10, 2017, Page No: 9-14

Strong Edge Cover of the Graph

D.K.Thakkar,B.M.Kakrecha

1.Department of Mathematics, Saurashtra University, Gujarat, India.
2.Department of Mathematics, L. E. College, Gujarat, India..

Citation : D.K.Thakkar,B.M.Kakrecha, Strong Edge Cover of the GraphInternational Journal of Scientific and Innovative Mathematical Research 2017,5(10) : 9-14

Abstract

The paper is about strong edge cover of the graph. The edge set of the graph is a strong edge cover if all the pendent edges belong to the edge set and among the non pendent edges if two distinct edges are adjacent then one edge must belong to the edge set. It is proved that every strong edge cover is an edge cover but the converse need not be true. The characterization of a minimal strong edge cover is given. The relation between strong edge cover and edge H-domination is discussed. The effect of vertex (edge) removal operation on strong edge covering number of the graph is observed.


Download Full paper: Click Here