On the metric determination of linear dependence graph
Optimal Control Applications and Methods · 2023-05 · 44 (3) · 1632-1647
DOI: 10.1002/oca.2883 ↗At a glance
Journal article in Optimal Control Applications and Methods, published online on 2022-03-17. Written by Muhammad Salman and 3 co-authors. Cited 4 times so far (Crossref); 44 references. Funded by: Türkiye Bilimsel ve Teknolojik Araştirma Kurumu.
Abstract (original language)
The metric on a connected graph G is a mapping which assigns to each pair of vertices in G the length of a shortest path between u and v . In this article, we consider the linear dependence graph associated with a finite dimensional vector space and determine its metric properties, namely, the center, the periphery, metric‐degree sequence, metric‐degree polynomial, metric dimension, connected metric dimension, local metric dimension, strong metric dimension, and the metric polynomial.
Funding
- Türkiye Bilimsel ve Teknolojik Araştirma Kurumu
Cite
APA
Salman, M., Rasheed, N., Rehman, M. U., & Cao, J. (2023). On the metric determination of linear dependence graph. Optimal Control Applications and Methods, 44(3), 1632-1647. https://doi.org/10.1002/oca.2883
Vancouver
Salman M, Rasheed N, Rehman MU, Cao J. On the metric determination of linear dependence graph. Optimal Control Applications and Methods. 2023;44(3):1632-1647. doi:10.1002/oca.2883
BibTeX
@article{Salman2023,
author = {Salman, Muhammad and Rasheed, Nimra and Rehman, Masood Ur and Cao, Jinde},
title = {On the metric determination of linear dependence graph},
journal = {Optimal Control Applications and Methods},
year = {2023},
volume = {44},
number = {3},
pages = {1632--1647},
doi = {10.1002/oca.2883}
}
EUVIMED