Related papers: A note on 'A New Approach To Compute Wiener Index'
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend…
Fullerene graphs are mathematical models of fullerene molecules. The Wiener $(r,s)$-complexity of a fullerene graph $G$ with vertex set $V(G)$ is the number of pairwise distinct values of $(r,s)$-transmission $tr_{r,s}(v)$ of its vertices…
Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their…
Approximate nearest neighbor (ANN) graph indices such as HNSW and Vamana construct their edge topology in full-precision or high-fidelity quantized metric spaces, relegating binary quantization (BQ) to a post-hoc distance estimator during…
The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. A cut is relevant if and only if it is the a minimum weight cut between two distinct vertices. Moreover, we give a characterization in terms of…
A formula based on a vertex contributions of the Steiner $k$-Wiener index is induced by a newly introduced $k$-Steiner betweenness centrality, which measures the number of $k$-Steiner trees that include a particular vertex as a non-terminal…
These notes represent a much expanded and updated version of the \textquotedblleft mini course\textquotedblright that the author gave at the ETH (Z\"{u}rich) and the University of Z\"{u}rich in February of 1995. The purpose of these notes…
The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the localized v-numbers of a binomial edge ideal $J_G$…
A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced variants such as normalized and ratio cuts have seen more…
Accurate segmentation of surgical instrument tip is an important task for enabling downstream applications in robotic surgery, such as surgical skill assessment, tool-tissue interaction and deformation modeling, as well as surgical…
Due to exponential growth of complex data, graph structure has become increasingly important to model various entities and their interactions, with many interesting applications including, bioinformatics, social network analysis, etc.…
Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boiling point, enthalpy of vaporization, strain energy, and…
Cuts in graphs are a fundamental object of study, and play a central role in the study of graph algorithms. The problem of sparsifying a graph while approximately preserving its cut structure has been extensively studied and has many…
The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of that vertex while preserving their degrees. Lov\'asz (1974)…
We study a class of stochastic semilinear damped wave equations driven by additive Wiener noise. Owing to the damping term, under appropriate conditions on the nonlinearity, the solution admits a unique invariant distribution. We apply…
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…
The transmission of a vertex $v$ in a (chemical) graph $G$ is the sum of distances from $v$ to other vertices in $G$. If any two vertices of $G$ have different transmissions, then $G$ is transmission irregular. The Wiener index $W(G)$ of a…
This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original…
Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over…