Volume 56, Number 5, September-October 2022
|Page(s)||3765 - 3776|
|Published online||01 November 2022|
Edge open packing sets in graphs
Department of Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil 626126, Tamil Nadu, India
2 Department of Mathematics, Thiagarajar College of Engineering, Madurai 625015, Tamil Nadu, India
* Corresponding author: email@example.com
Accepted: 3 October 2022
In a graph G = (V, E), two edges e1 and e2 are said to have a common edge if there exists an edge e ∈ E(G) different from e1 and e2 such that e joins a vertex of e1 to a vertex of e2 in G. That is, 〈e1, e, e2〉 is either P4 or K3 in G. A non-empty set D ⊆ E(G) is an edge open packing set of a graph G if no two edges of D have a common edge in G. The maximum cardinality of an edge open packing set is the edge open packing number of G and is denoted by ρoe(G). In this paper, we initiate a study on this parameter.
Mathematics Subject Classification: 05C
Key words: Injective coloring / 2-edge packing / open packing number
© The authors. Published by EDP Sciences, ROADEF, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.