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!
|
| _version_ | 1832544092947480576 |
|---|---|
| author | Muhammad Shoaib Sardar Hamna Choudhry Jia-Bao Liu |
| author_facet | Muhammad Shoaib Sardar Hamna Choudhry Jia-Bao Liu |
| author_sort | Muhammad Shoaib Sardar |
| collection | DOAJ |
| description | 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∈E−M, the sets Ne1∩M and Ne2∩M are nonempty and different. The edge domination number γLG of G is the minimum cardinality of all edge-dominating sets of G. The purpose of this study is to determine the locating edge domination number of certain types of claw-free cubic graphs. |
| format | Article |
| id | doaj-art-e673d7a722f041b3ac92cb4fce8dc211 |
| institution | Kabale University |
| issn | 2314-8888 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Function Spaces |
| spelling | doaj-art-e673d7a722f041b3ac92cb4fce8dc2112025-02-03T10:59:59ZengWileyJournal of Function Spaces2314-88882024-01-01202410.1155/2024/1182858Locating Edge Domination Number of Some Classes of Claw-Free Cubic GraphsMuhammad Shoaib Sardar0Hamna Choudhry1Jia-Bao Liu2School of Mathematics and StatisticsSchool of MathematicsSchool of Mathematics and PhysicsLet 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∈E−M, the sets Ne1∩M and Ne2∩M are nonempty and different. The edge domination number γLG of G is the minimum cardinality of all edge-dominating sets of G. The purpose of this study is to determine the locating edge domination number of certain types of claw-free cubic graphs.http://dx.doi.org/10.1155/2024/1182858 |
| spellingShingle | Muhammad Shoaib Sardar Hamna Choudhry Jia-Bao Liu Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs Journal of Function Spaces |
| title | Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs |
| title_full | Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs |
| title_fullStr | Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs |
| title_full_unstemmed | Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs |
| title_short | Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs |
| title_sort | locating edge domination number of some classes of claw free cubic graphs |
| url | http://dx.doi.org/10.1155/2024/1182858 |
| work_keys_str_mv | AT muhammadshoaibsardar locatingedgedominationnumberofsomeclassesofclawfreecubicgraphs AT hamnachoudhry locatingedgedominationnumberofsomeclassesofclawfreecubicgraphs AT jiabaoliu locatingedgedominationnumberofsomeclassesofclawfreecubicgraphs |