Related papers: A note on distance magic index of partite graphs
A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for…
A conjugate skew gain graph is a skew gain graph with the labels (also called, the conjugate skew gains) from the field of complex numbes on the oriented edges such that they get conjugated when we reverse the orientation. In this paper we…
It is well known that the complete multipartite graphs can not be determined by their adjacency spectra. But in this paper, we prove that they can be determined by their distance spectra, which confirms the conjecture proposed by Lin, Hong,…
Lipman et al. [ACM Transactions on Graphics 29 (3) (2010), 1--11] introduced the concept of biharmonic distance to measure the distances between pairs of points on a 3D surface. Biharmonic distance has some advantages over resistance…
Let $G$ be a connected graph on $n$ vertices and $D(G)$ its distance matrix. The formula for computing the determinant of this matrix in terms of the number of vertices is known when the graph is either a tree or {a} unicyclic graph. In…
A design graph is a regular bipartite graph in which any two distinct vertices of the same part have the same number of common neighbors. This class of graphs have a close relationship to strongly regular graphs. In this paper, we study the…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
This paper considers the degree-diameter problem for extremal and largest known undirected circulant graphs of degree 2 to 9 of arbitrary diameter. As these graphs are vertex transitive it is possible to define their distance partition. The…
Given a set D of positive integers, the associated distance graph on the integers is the graph with the integers as vertices and an edge between distinct vertices if their difference lies in D. We investigate the chromatic numbers of…
We determine (multi)graded Betti numbers of path ideals of lines and star graphs.
A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…
In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport…
In this paper we have discussed the group vertex magicness of H-join of family of graphs and generalized friendship graph.
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut…
Let $G=(V,E)$ be a graph of order $n$. A closed distance magic labeling of $G$ is a bijection $\ell \colon V(G)\rightarrow \{1,\ldots ,n\}$ for which there exists a positive integer $k$ such that $\sum_{x\in N[v]}\ell (x)=k$ for all $v\in V…
We answer a question of Brass about vertex degrees in unit distance graphs of finitely generated additive subgroups of $\mathbb{R}^2$.
In this paper we present a new class of integer partition identities. The number of partitions with d-distant parts can be represented as a sum of the number of partitions with 1-distant parts whose even parts are greater than twice the…
If we are given a connected finite graph $G$ and a subset of its vertices $V_{0}$, we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_{0}$. Some properties and examples of…