A Comparative Study of Three Resolving Parameters of Graphs
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures, among other things. It is also useful in air...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/1927181 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832559197013671936 |
|---|---|
| author | Hafiz Muhammad Ikhlaq Hafiz Muhammad Afzal Siddiqui Muhammad Imran |
| author_facet | Hafiz Muhammad Ikhlaq Hafiz Muhammad Afzal Siddiqui Muhammad Imran |
| author_sort | Hafiz Muhammad Ikhlaq |
| collection | DOAJ |
| description | Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures, among other things. It is also useful in airplane scheduling and the study of diffusion mechanisms. The parameters computed in this article are very useful in pattern recognition and image processing. A number df,w=mindw,t,dw,s is referred as distance between f=ts an edge and w a vertex. dw,f1≠dw,f2 implies that two edges f1,f2∈E are resolved by node w∈V. A set of nodes A is referred to as an edge metric generator if every two links/edges of Γ are resolved by some nodes of A and least cardinality of such sets is termed as edge metric dimension, edimΓ for a graph Γ. A set B of some nodes of Γ is a mixed metric generator if any two members of V∪E are resolved by some members of B. Such a set B with least cardinality is termed as mixed metric dimension, mdimΓ. In this paper, the metric dimension, edge metric dimension, and mixed metric dimension of dragon graph Tn,m, line graph of dragon graph LTn,m, paraline graph of dragon graph LSTn,m, and line graph of line graph of dragon graph LLTn,m have been computed. It is shown that these parameters are constant, and a comparative analysis is also given for the said families of graphs. |
| format | Article |
| id | doaj-art-322f48d346be46db8826bc747a67360c |
| institution | Kabale University |
| issn | 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-322f48d346be46db8826bc747a67360c2025-02-03T01:30:33ZengWileyComplexity1099-05262021-01-01202110.1155/2021/1927181A Comparative Study of Three Resolving Parameters of GraphsHafiz Muhammad Ikhlaq0Hafiz Muhammad Afzal Siddiqui1Muhammad Imran2Department of MathematicsDepartment of MathematicsDepartment of Mathematical SciencesGraph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures, among other things. It is also useful in airplane scheduling and the study of diffusion mechanisms. The parameters computed in this article are very useful in pattern recognition and image processing. A number df,w=mindw,t,dw,s is referred as distance between f=ts an edge and w a vertex. dw,f1≠dw,f2 implies that two edges f1,f2∈E are resolved by node w∈V. A set of nodes A is referred to as an edge metric generator if every two links/edges of Γ are resolved by some nodes of A and least cardinality of such sets is termed as edge metric dimension, edimΓ for a graph Γ. A set B of some nodes of Γ is a mixed metric generator if any two members of V∪E are resolved by some members of B. Such a set B with least cardinality is termed as mixed metric dimension, mdimΓ. In this paper, the metric dimension, edge metric dimension, and mixed metric dimension of dragon graph Tn,m, line graph of dragon graph LTn,m, paraline graph of dragon graph LSTn,m, and line graph of line graph of dragon graph LLTn,m have been computed. It is shown that these parameters are constant, and a comparative analysis is also given for the said families of graphs.http://dx.doi.org/10.1155/2021/1927181 |
| spellingShingle | Hafiz Muhammad Ikhlaq Hafiz Muhammad Afzal Siddiqui Muhammad Imran A Comparative Study of Three Resolving Parameters of Graphs Complexity |
| title | A Comparative Study of Three Resolving Parameters of Graphs |
| title_full | A Comparative Study of Three Resolving Parameters of Graphs |
| title_fullStr | A Comparative Study of Three Resolving Parameters of Graphs |
| title_full_unstemmed | A Comparative Study of Three Resolving Parameters of Graphs |
| title_short | A Comparative Study of Three Resolving Parameters of Graphs |
| title_sort | comparative study of three resolving parameters of graphs |
| url | http://dx.doi.org/10.1155/2021/1927181 |
| work_keys_str_mv | AT hafizmuhammadikhlaq acomparativestudyofthreeresolvingparametersofgraphs AT hafizmuhammadafzalsiddiqui acomparativestudyofthreeresolvingparametersofgraphs AT muhammadimran acomparativestudyofthreeresolvingparametersofgraphs AT hafizmuhammadikhlaq comparativestudyofthreeresolvingparametersofgraphs AT hafizmuhammadafzalsiddiqui comparativestudyofthreeresolvingparametersofgraphs AT muhammadimran comparativestudyofthreeresolvingparametersofgraphs |