Metric dimension of star fan graph
Abstract Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various const...
Saved in:
Main Authors: | S. Prabhu, D. Sagaya Rani Jeba, Sudeep Stephen |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Scientific Reports |
Subjects: | |
Online Access: | https://doi.org/10.1038/s41598-024-83562-6 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01) -
The adjacency dimension of some path related trees
by: Elham Hardany, et al.
Published: (2025-01-01) -
Examination Of The Relationship Between The Identification Levels And Aggression Levels Of The Fans; Example Of Alanyaspor Fans
by: Yasemin Karademir, et al.
Published: (2020-09-01) -
Mind perception and fan fiction: a survey using the IDOLM@STER series
by: Tetsuya Matsui
Published: (2025-12-01) -
Effect of Victories and Defeats on the Attitude of Soccer Fans: a Study Concerning Pitchman, Involvement and Fanaticism
by: Fernando A. Fleury, et al.
Published: (2016-01-01)