Results 11 to 20 of about 251,114 (266)

Exact Distance Graphs of Product Graphs [PDF]

open access: yesGraphs 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   +3 more
openaire   +4 more sources

On the graph of large distances [PDF]

open access: yesDiscrete & Computational Geometry, 1989
Let \(S\) be a set of \(n\) points in the plane and let \(d_1>d_2>..\). be the different distances determined by the set \(S\). The graph \(G(S,k)\) is considered whose vertex set is S and in which two vertices are adjacent if and only if their distance is at least \(k\). The chromatic number \(\chi(G(S,k))\) of \(G(S,k)\) is studied. It is proved that
Erdös, P.   +2 more
openaire   +1 more source

Some distance magic graphs

open access: yesAKCE 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

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

open access: yesJournal 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

open access: yesDiscussiones 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   +2 more
doaj   +1 more source

The distance seidel spectrum of some graph operations [PDF]

open access: yesJournal 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.

open access: yesPLoS 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

A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs

open access: yesمجلة بغداد للعلوم, 2023
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)
BIBIN K JOSE
doaj   +1 more source

Graph Distances and Clustering

open access: yesCoRR, 2020
11 pages.
Pierre Miasnikof   +3 more
openaire   +2 more sources

The -distance chromatic number of trees and cycles

open access: yesAKCE 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

Home - About - Disclaimer - Privacy