Searcharxiv⌕ Search

arXiv subjects

Ghulam Haidar

Publications and source records attributed to Ghulam Haidar.

3 recordsLinked to original sources

Resistance-regular graphs need not be regular

A connected graph is resistance-regular if the sum of the effective resistances from a vertex to all other vertices does not depend on the vertex, or equivalently if the Moore-Penrose inverse of its Laplacian has constant diagonal. Walk-regular graphs have this property, and Zhou, Wang and Bu asked in 2016 whether every resistance-regular graph is regular, a question that also arises in the study of graphs with constant resistance curvature. We answer this question in the negative and examine both what resistance-regularity forces and how far from regular such graphs can be. On the spectral side, we prove that a connected graph is walk-regular if and only if the first $m-1$ powers of its Laplacian pseudoinverse have constant diagonal, where $m$ is the number of distinct nonzero Laplacian eigenvalues. Because resistance-regularity constrains only the first power, it forces regularity when $m\le2$ and allows at most two vertex degrees when $m=3$. Any non-regular resistance-regular graph has minimum degree at least $3$ and a connected complement, and an exhaustive computer search shows that it must have at least $13$ vertices. For every even $p\ge4$, we construct a resistance-regular graph on $4p$ vertices with degrees $2p-2$ and $2p-1$, obtaining closed formulas for its Laplacian spectrum and for all pairwise effective resistances. Using module blow-ups, we then construct $n$-vertex resistance-regular graphs whose two degrees differ by $(\sqrt{4n+1}-5)/4$ for infinitely many $n$, as well as examples with three and four distinct degrees, whereas the maximum and minimum degrees of any resistance-regular graph on $n$ vertices differ by less than $n/2$. We close by conjecturing that in a resistance-regular graph the sum of squared resistances at a vertex increases strictly with its degree.

math.CO↗

Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management

A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a resolving set. The smallest set satisfying this property is the fault tolerant metric basis, and the cardinality of this set is termed as fault tolerant metric dimension of $G$, denoted by $β'(G)$. In this article, we determine the fault tolerant metric dimension of bicyclic graphs of type-I and II and show that it is always $4$ for both types of graphs. We then use these results to form our basis to consider leafless cacti graphs, and calculate their fault tolerant metric dimensions in terms of \textit{inner cycles} and \textit{outer cycles}. We then consider a detailed real world example of supply and distribution center management, and discuss the application of fault tolerant metric dimension in such a scenario. We also briefly discuss some other scenarios where leafless cacti graphs can be used to model real world problems.

cs.DM↗

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

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.

math.GM↗