Related papers: Resolving Share and Topological Index
The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…
We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been proposed to answer such distance queries. However, all of…
Evaluating graphs learned by causal discovery algorithms is difficult: The number of edges that differ between two graphs does not reflect how the graphs differ with respect to the identifying formulas they suggest for causal effects. We…
In chemical graph theory, a topological index is a numerical representation of a chemical network while a topological descriptor correlates certain physico-chemical characteristics of underlying chemical compounds besides its chemical…
Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom-bond connectivity index, $ABC_3$ index, of $G$ is defined as $ABC_3(G)=\sum\limits_{uv\in E(G)}\sqrt{\frac{e(u)+e(v)-2}{e(u)e(v)}}$, where…
A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does not contain arcs inside each partition element, and the arcs…
Two distinct structures of aggregates of atoms connected by anisotropic bonds with a network configuration are discussed from the viewpoint of a point set topology. A specific topological space connects the two types of topological…
Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and…
In topological data analysis, we want to discern topological and geometric structure of data, and to understand whether or not certain features of data are significant as opposed to simply random noise. While progress has been made on…
We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…
The reciprocal degree resistance distance index of a connected graph $G$ is defined as $RDR(G)=\sum\limits_{\{u,v\}\subseteq V(G)}\frac {d_G(u)+d_G(v)}{r_G(u,v)}$, where $r_G(u,v)$ is the resistance distance between vertices $u$ and $v$ in…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d(u,w)$ denote the length of a $u-w$ geodesic in $G$. For any $v\in V(G)$ and $e=xy\in E(G)$, let $d(e,v)=\min\{d(x,v),d(y,v)\}$. For distinct $e_1, e_2\in E(G)$, let…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We study the problem of inferring network topology from information cascades, in which the amount of time taken for information to diffuse across an edge in the network follows an unknown distribution. Unlike previous studies, which assume…
Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
An abstract topological graph (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 edges of $G$. A realization of $A$ is a drawing $\Gamma_A$ of $G$ in the plane…
A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…