Metric-Based Resolvability of Quartz Structure
Source abstract
Abstract
Silica has three major varieties of crystalline. Quartz is the main and abundant ingredient in the crust of our earth. While other varieties are formed by the heating of quartz. Silica quartz is a rich chemical structure containing enormous properties. Any chemical network or structure can be transformed into a graph, where atoms become vertices and the bonds are converted to edges, between vertices. This makes a complex network easy to visualize to work on it. There are many concepts to work on chemical structures in terms of graph theory but the resolvability parameters of a graph are quite advance and applicable topic. Resolvability parameters of a graph is a way to getting a graph into unique form, like each vertex or edge has a unique identification by means of some selected vertices, which depends on the distance of vertices and its pattern in a particular graph. We have dealt some resolvability parameters of quartz. We computed the resolving set for quartz structure and its variants, wherein we proved that all the variants of resolvability parameters of quartz structures are constant and do not depend on the order of the graph.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Graph Labeling and Dimension Problems · Graph theory and applications · Computational Drug Discovery Methods
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (51)
Show source-provided references
1. On the metric dimension of a graph
2. Leaves of trees
3. On the metric dimension of cartesian product of graphs10.1137/050641867 ↗
4. Uniquely identifying the edges of a graph: The edge metric dimension10.1016/j.dam.2018.05.052 ↗
5. Fault-tolerant edge metric dimension of certain families of graphs10.3934/math.2021069 ↗
6. The partition dimension of graph10.1007/PL00000127 ↗
7. Approximation complexity of metric dimension problem10.1016/j.jda.2011.12.010 ↗
8. Computers and intractability. a guide to the theory of np-completeness10.2307/2273574 ↗
9. Network discovery and verification10.1109/JSAC.2006.884015 ↗
10. On minimum metric dimension of honeycomb networks10.1016/j.jda.2006.09.002 ↗
11. Evolutionary dynamics of group interactions on structured populations: A review10.1098/rsif.2012.0997 ↗
12. Coevolutionary games-a mini review10.1016/j.biosystems.2009.10.003 ↗
13. A combinatory detection problem10.1080/00029890.1963.11992174 ↗
14. Landmarks in graphs10.1016/0166-218X(95)00106-2 ↗
15. On metric generators of graphs10.1287/moor.1030.0070 ↗
16. Resolvability in graphs and the metric dimension of a graph10.1016/S0166-218X(00)00198-0 ↗
17. Mastermind10.1007/BF02579188 ↗
18. Structure-activity maps for visualizing the graph variables arising in drug design10.1080/10543409308835060 ↗
19. Computing the upper bounds for the metric dimension of cellulose network
20. Metric bases in digital geometry10.1016/0734-189X(84)90051-3 ↗
21. Topological indices of rhombus type silicate and oxide networks10.1139/cjc-2016-0486 ↗
22. On the fault-tolerant metric dimension of certain interconnection networks10.1007/s12190-018-01225-y ↗
23. Fault-tolerant resolvability and extremal structures of graphs10.3390/math7010078 ↗
24. Fault-tolerant resolvability of oxide interconnections
25. On the fault-tolerant metric dimension of convex polytopes
26. The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph10.1142/S1793557121500625 ↗
27. Edge metric and fault-tolerant edge metric dimension of hollow coronoid10.3390/math9121405 ↗
28. On the edge metric dimension of convex polytopes and its related graphs10.1007/s10878-019-00472-4 ↗
29. Computing the edge metric dimension of convex polytopes related graphs10.22436/jmcs.022.02.08 ↗
30. Barycentric subdivision of cayley graphs with constant edge metric dimension10.1109/ACCESS.2020.2990109 ↗
31. On sharp bounds on partition dimension of convex polytopes10.1109/ACCESS.2020.3044498 ↗
32. Bounds on the partition dimension of convex polytopes
33. On the partition dimension of tri-hexagonal alpha-boron nanotube10.1109/ACCESS.2021.3071716 ↗
34. The locating number of hexagonal möbius ladder network10.1007/s12190-020-01430-8 ↗
35. All graphs of order10.1016/j.heliyon.2020.e03694 ↗
36. On partition dimension of fullerene graphs10.3934/Math.2018.3.343 ↗
37. Computing metric dimension and metric basis of10.3390/sym10080300 ↗
38. On the metric dimension of silicate stars
39. Computing the metric and partition dimension of h-naphtalenic and vc5c7 nanotubes
40. Johnson · B rowsable Structure-Activity Datasets, Advances in Molecular Similarity · 1998 · 2 · 153
41. Metric-based resolvability of polycyclic aromatic hydrocarbons10.1140/epjp/s13360-021-01399-8 ↗
42. Fault-tolerant metric and partition dimension of graphs
43. Vertices, edges, distances and metric dimension in graphs10.1016/j.endm.2016.10.047 ↗
44. Vertex cut method for degree and distance-based topological indices and its applications to silicate networks10.1007/s10910-016-0646-3 ↗
45. Hyper-wiener and wiener polarity indices of silicate and oxide frameworks10.1007/s10910-018-0881-x ↗
46. Distance-based topological indices of10.1007/s10910-018-0956-8 ↗
47. On topological indices of poly oxide, poly silicate, dox, and dsl networks10.1139/cjc-2014-0490 ↗
48. M-polynomials and topological indices of silicate and oxide networks10.12732/ijpam.v115i1.11 ↗
49. Fault-tolerance in resolvability
50. Cas scf/ci calculations on10.1016/0009-2614(87)85157-6 ↗
51. Geometries and spectroscopic properties of silicon clusters10.1063/1.1446027 ↗