Related papers: Katz similarity index comparisons
Linear-width is a well-known and highly regarded graph parameter. The concept of Single Ideal and Linear obstacle serves as an obstruction to linear-width on a connectivity sysem. In this concise paper, we present an alternative proof for…
Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length…
From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented…
Let $G$ be a $k$-connected graph with $k\geq 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {specified} vertices with length at least the average degree…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
The Kirchhoff index is defined as the sum of resistance distances between all pairs of vertices in a graph. This index is a critical parameter for measuring graph structures. In this paper, we characterize polygonal chains with the minimum…
We introduce the \emph{idemetric} property, which formalises the idea that most nodes in a graph have similar distances between them, and which turns out to be quite standard amongst small-world network models. Modulo reasonable sparsity…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…
How do social networks differ across platforms? How do information networks change over time? Answering questions like these requires us to compare two or more graphs. This task is commonly treated as a measurement problem, but numerical…
In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it…
We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultaneous representation problem for interval graphs and defined…
In this paper we give a survey of methods used to calculate values of resistance distance (also known as effective resistance) in graphs. Resistance distance has played a prominent role not only in circuit theory and chemistry, but also in…
In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching…
We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…
The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distances between all unordered pairs of vertices, which was introduced by Klein and Randi\'c. In this paper we characterized all extremal graphs with Kirchhoff index among…
Pairwise comparisons between alternatives are a well-known method for measuring preferences of a decision-maker. Since these often do not exhibit consistency, a number of inconsistency indices has been introduced in order to measure the…
The paper attempts to develop a suitable accessibility index for networks where each link has a value such that a smaller number is preferred like distance, cost, or travel time. A measure called distance sum is characterized by three…
In relation to spatiotemporal intermittency, as it can be observed in coupled map lattices, we study the stability of different wavelengths in competition. Introducing a two dimensional map, we compare its dynamics with the one of the whole…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…