Abstract
In a graphG = (V, E), two edgese1ande2are said to have acommon edgeif there exists an edgee ∈ E(G) different frome1ande2such thatejoins a vertex ofe1to a vertex ofe2inG. That is, 〈e1, e, e2〉 is eitherP4orK3inG. A non-empty setD ⊆ E(G) is anedge open packing setof a graphGif no two edges ofDhave a common edge inG. The maximum cardinality of an edge open packing set is theedge open packing numberofGand is denoted byρoe(G). In this paper, we initiate a study on this parameter.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
