The Multibases of Symmetric Caterpillars
For a set W=w1,w2,…,wk of vertices and a vertex v of a connected graph G, the k-multiset mrvW=dv,w1,dv,w2,…,dv,wk, where dv,wi is the distance from v to wi for i=1,2,…,k, and is the multirepresentation of v with respect to W. The set W is a multiresolving set of G if the multirepresentations of ever...
Main Authors: | Supachoke Isariyapalakul, Varanoot Khemmani, Witsarut Pho-on |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2020/5210628 |
Similar Items
-
The Multiresolving Sets of Graphs with Prescribed Multisimilar Equivalence Classes
by: Varanoot Khemmani, et al.
Published: (2018-01-01) -
Low-Complexity Distributed Multibase Transmission and Scheduling
by: Are Hjørungnes, et al.
Published: (2008-04-01) -
Greedy SINR Maximization in Collaborative Multibase Wireless Systems
by: Popescu Otilia, et al.
Published: (2004-01-01) -
Greedy SINR Maximization in Collaborative Multibase Wireless Systems
by: Popescu Otilia, et al.
Published: (2004-01-01) -
Caterpillars, ribbons, and the chromatic symmetric function
by: Morin, Matthew
Published: (2009)