Results 31 to 40 of about 118,378,802 (306)
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
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
Steiner Wiener index of graph products [PDF]
Transactions on Combinatorics, 2016 The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj
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 +2 more
doaj +1 more source
Fast suboptimal algorithms for the computation of graph edit distance [PDF]
, 2006 Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of ...
Michel Neuhaus +5 more
core +1 more source
The distance coloring of graphs [PDF]
Acta Mathematica Sinica, English Series, 2014 Let $G$ be a connected graph with maximum degree $Δ\ge 3$. We investigate the upper bound for the chromatic number $χ_γ(G)$ of the power graph $G^γ$. It was proved that $χ_γ(G) \leΔ\frac{(Δ-1)^γ-1}{Δ-2}+1=:M+1$ with equality if and only $G$ is a Moore graph.
Miao, Lian Ying, Fan, Yi Zheng
openaire +2 more sources
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 +2 more
core +1 more source
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj
Minimal Graphs with a Specified Code Map Image
Theory and Applications of Graphs, 2018 Let $G$ be a graph and $e_1,\cdots ,e_n$ be $n$ distinct vertices. Let $\rho$ be the metric on $G$. The code map on vertices, corresponding to this list, is $c(x)=(\rho (x,e_1),\cdots ,\rho (x,e_n))$.
Paul Feit
doaj +1 more source
Optimizing Distance Computation in Distributed Graph Systems
IEEE Access, 2020 Given a large graph, such as a social network or a knowledge graph, a fundamental query is how to find the distance from a source vertex to another vertex in the graph.
Qing Wang +5 more
doaj +1 more source