Results 21 to 30 of about 1,232,284 (259)

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 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

Note on group distance magic graphs $G[C_4]$ [PDF]

, 2012
A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$
D. Froncek, D. Froncek, M. Miller, Sylwia Cichacz   +3 more
core   +2 more sources

The distance spectrum of corona and cluster of two graphs

AKCE International Journal of Graphs and Combinatorics, 2015
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj   +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

Geometric aspects of 2-walk-regular graphs [PDF]

, 2013
A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular graphs and $t$
Cámara, Marc, Koolen, Jack H., Park, Jongyook, van Dam, Edwin R.   +3 more
core   +1 more source

On the Distance Pattern Distinguishing Number of a Graph

Journal of Applied Mathematics, 2014
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj   +1 more source

Closed trail distance in a biconnected graph. [PDF]

PLoS ONE, 2018
Graphs describe and represent many complex structures in the field of social networks, biological, chemical, industrial and transport systems, and others.
Vaclav Snasel, Pavla Drazdilova, Jan Platos   +2 more
doaj   +1 more source

On the editing distance of graphs [PDF]

, 2008
An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\mathcal{G}$, the editing distance from $G$ to $\mathcal{G}$ is the smallest number of edge ...
Axenovich, Baker, Bollobás, Bollobás, Bollobás, Chen, Downey, Erdős, Erdős, Erdős, Erdős, Erdős, Erdős, Füredi, Janson, Komlós, Komlós, Lesniak, Prömel, Prömel, Simonovits, Stephanopoulos, Szemerédi, Turán, West   +24 more
core   +2 more sources

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