Results 11 to 20 of about 2,418,413 (302)

Exact Distance Graphs of Product Graphs [PDF]

Graphs and Combinatorics, 2019
Given a graph $G$, the exact distance-$p$ graph $G^{[\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product.
Brešar, Boštjan, Gastineau, Nicolas, Klavžar, Sandi, Togni, Olivier   +3 more
openaire   +5 more sources

Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]

, 2015
Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King, Jones, William, King, Andy, William Jones, Aziem Chawdhary, Chawdhary, Aziem   +5 more
core   +1 more source

Some distance magic graphs

AKCE International Journal of Graphs and Combinatorics, 2018
A graph , where and is said to be a distance magic graph if there exists a bijection from the vertex set to the set such that, , for all , which is a constant and independent of , where is the open neighborhood of the vertex .
Aloysius Godinho, T. Singh
doaj   +2 more sources

Open Distance-Pattern Uniform Graphs [PDF]

, 2009
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core   +1 more source

On the Change of Distance Energy of Complete Bipartite Graph due to Edge Deletion

Journal of Mathematics, 2021
The distance energy of a graph is defined as the sum of absolute values of distance eigenvalues of the graph. The distance energy of a graph plays an important role in many fields.
Shaowei Sun, Ziyan Wan
doaj   +1 more source

Coloring Some Finite Sets in ℝn

Discussiones Mathematicae Graph Theory, 2013
This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn
Balogh József, Kostochka Alexandr, Raigorodskii Andrei   +2 more
doaj   +1 more source

The distance seidel spectrum of some graph operations [PDF]

Journal of Hyperstructures
The distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied in detail in literature where as the study on distance seidel matrix associated with a connected graph is in progress. The eigenvalues ∂1S≥∂2S≥ ...
Deena Scaria, Indulal Gopal
doaj   +1 more source

Metrics for graph comparison: A practitioner's guide.

PLoS ONE, 2020
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.
Peter Wills, François G Meyer
doaj   +1 more source

The H-Line Signed Graph of a Signed Graph [PDF]

, 2010
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota, Subramanya, M.S., Rangarajan, R.   +2 more
core   +1 more source

The -distance chromatic number of trees and cycles

AKCE International Journal of Graphs and Combinatorics, 2019
For any positive integer , a -distance coloring of a graph is a vertex coloring of in which no two vertices at distance less than or equal to receive the same color.
Niranjan P.K., Srinivasa Rao Kola
doaj   +2 more sources