Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.3390/math6110243 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/math6110243 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900101803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landmarks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvability in graphs and the metric dimension of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Base size, metric dimension and other invariants of groups and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3144348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5497268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5412687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectra and distance energies of iterated line graphs of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological indices of the line graph of subdivision graphs and their Schur-bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3144349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely identifying the edges of a graph: the edge metric dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the metric dimension of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric Dimension of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension and Zero Forcing Number of Two Families of Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets of prism graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Family of Planar Bicritical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4685236 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128966771 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3390/MATH6110243 / rank
 
Normal rank

Latest revision as of 01:02, 11 December 2024

scientific article
Language Label Description Also known as
English
Edge version of metric dimension and doubly resolving sets of the necklace graph
scientific article

    Statements

    Edge version of metric dimension and doubly resolving sets of the necklace graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2018
    0 references
    Summary: Consider an undirected and connected graph \(G = (V_G, E_G)\), where \(V_G\) and \(E_G\) represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.
    0 references
    necklace graph
    0 references
    resolving sets
    0 references
    edge version of metric dimension
    0 references
    edge version of doubly resolving sets
    0 references

    Identifiers