Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
Consider an undirected and connected graph <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mo>=</mo> <mo>(</mo> <msub> <mi>V</mi> <mi>G</mi> </msub> <mo>,</mo>...
मुख्य लेखकों: | , , , |
---|---|
स्वरूप: | लेख |
भाषा: | English |
प्रकाशित: |
MDPI AG
2018-11-01
|
श्रृंखला: | Mathematics |
विषय: | |
ऑनलाइन पहुंच: | https://www.mdpi.com/2227-7390/6/11/243 |