Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs
Let G=V;E be a simple graph with vertex set V and edge set E. In a graph G, a subset of edges denoted by M is referred to as an edge-dominating set of G if every edge that is not in M is incident to at least one member of M. A set M⊆E is the locating edge-dominating set if for every two edges e1,e2∈...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Function Spaces |
| Online Access: | http://dx.doi.org/10.1155/2024/1182858 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|