Metric dimensions of bicyclic graphs with potential applications in Supply Chain Logistics

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Wang, Muwen, Haidar, Ghulam, Yousafzai, Faisal, Khan, Murad Ul Islam, Sikandar, Waseem, Khan, Asad Ul Islam
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929487144288256
author Wang, Muwen
Haidar, Ghulam
Yousafzai, Faisal
Khan, Murad Ul Islam
Sikandar, Waseem
Khan, Asad Ul Islam
author_facet Wang, Muwen
Haidar, Ghulam
Yousafzai, Faisal
Khan, Murad Ul Islam
Sikandar, Waseem
Khan, Asad Ul Islam
contents Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($Θ$-graphs), the metric dimension is $3$ only, when all paths have equal lengths, or when one of the outside path has a length $2$ more than the other two paths. In this article, we refute this claim and show that the case where the middle path is $2$ vertices more than the other two paths, also has metric dimension $3$. We also determine the metric dimension for other values of $p,q,r$ which were omitted in the recent research due to the constraint $p \leq q \leq r$. We also propose a graph-based technique to transform an agricultural supply chain logistics problem into a mathematical model, by using metric basis and metric dimensions. We provide a theoretical groundwork which can be used to model and solve these problems using machine learning algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2409_02947
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Metric dimensions of bicyclic graphs with potential applications in Supply Chain Logistics
Wang, Muwen
Haidar, Ghulam
Yousafzai, Faisal
Khan, Murad Ul Islam
Sikandar, Waseem
Khan, Asad Ul Islam
General Mathematics
05C12, 05C90
Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($Θ$-graphs), the metric dimension is $3$ only, when all paths have equal lengths, or when one of the outside path has a length $2$ more than the other two paths. In this article, we refute this claim and show that the case where the middle path is $2$ vertices more than the other two paths, also has metric dimension $3$. We also determine the metric dimension for other values of $p,q,r$ which were omitted in the recent research due to the constraint $p \leq q \leq r$. We also propose a graph-based technique to transform an agricultural supply chain logistics problem into a mathematical model, by using metric basis and metric dimensions. We provide a theoretical groundwork which can be used to model and solve these problems using machine learning algorithms.
title Metric dimensions of bicyclic graphs with potential applications in Supply Chain Logistics
topic General Mathematics
05C12, 05C90
url https://arxiv.org/abs/2409.02947