Related papers: Resolving Share and Topological Index
For any graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges, and a positive integer $r$, by $\chi'_{\Sigma,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
The first Zagreb index of a graph $G$ is the sum of squares of the vertex degrees in a graph and the second Zagreb index of $G$ is the sum of products of degrees of adjacent vertices in $G$. The imbalance of an edge in $G$ is the numerical…
The ellipticity graph of a free group $F$ was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of $F$, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface.…
For $k \geq 1$, in a graph $G=(V,E)$, a set of vertices $D$ is a distance $k$-dominating set of $G$, if any vertex in $V\setminus D$ is at distance at most $k$ from some vertex in $D$. The minimum cardinality of a distance $k$-dominating…
Dominating sets and resolving sets have important applications in control theory and computer science. In this paper, we introduce an edge-analog of the classical dominant metric dimension of graphs. By combining the concepts of a…
Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The collection of…
The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph with experimentally gathered data regarding the compound's…
The Hosoya index $Z (G)$ of a graph $G$ is defined as the total number of edge independent sets of $G$. In this paper, we extend the research of [J. Ou, On extremal unicyclic molecular graphs with maximal Hosoya index, \textit{Discrete…
Let $G$ be connected uniform hypergraph and let $\mathcal{A}(G)$ be the adjacency tensor of $G$. The stabilizing index of $G$ is the number of eigenvectors of $\mathcal{A}(G)$ associated with the spectral radius, and the cyclic index of $G$…
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
Let $G=(V,E)$ be a graph and $e=uv\in E$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as…
An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{X})$ where $G=(V,E)$ is a graph and $\mathcal{X}\subseteq {E \choose 2}$ is a set of pairs of its edges. The AT-graph $A$ is simply realizable if $G$ can be drawn…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
Motivated by multi-topology building and city model data, first a lossless representation of multiple $T_0$-topologies on a given finite set by a vertex-edge-weighted graph is given, and the subdominant ultrametric of the associated…