Results 31 to 40 of about 7,350,988 (308)
TOTAL COLORING OF CENTRAL GRAPH OF STAR GRAPH [PDF]
, 2019 Total coloring of a graph given color the vertices and edge of a graph in such a way that no two adjacent vertices are assigned with the same color, no two adjacent edges are assigned with the same color and no edge and vertices are assigned with the ...
MUSPIRATUN, HENI
core +1 more source
Forcing (G,D)-number of a Graph [PDF]
, 2011 By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A. +3 more
core +1 more source
TMGAT:Graph Attention Network with Type Matching Constraint [PDF]
Jisuanji kexueThe graph structure has recently been employed to solve the KGC problem of knowledge graph completion.The graph neural network(GNNs) constantly updates the representation of the central entity by aggregating the entity's local neighborhood information ...
SUN Shounan, WANG Jingbin, WU Renfei, YOU Changkai, KE Xifan, HUANG Hao
doaj +1 more source
Regularizing graph centrality computations [PDF]
Journal of Parallel and Distributed Computing, 2015 Centrality metrics such as betweenness and closeness have been used to identify important nodes in a network. However, it takes days to months on a high-end workstation to compute the centrality of today's networks. The main reasons are the size and the irregular structure of these networks.
Ahmet Erdem Sariyüce +3 more
openaire +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Discussiones Mathematicae Graph Theory, 2015 Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Forouhandeh S.F. +4 more
doaj +1 more source
Central limit theorem for the principal eigenvalue and eigenvector of Chung–Lu random graphs
Journal of Physics: Complexity, 2023 A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees ...
Pierfrancesco Dionigi +4 more
doaj +1 more source
On centrality functions of a graph [PDF]
, 1981 For a connected nondirected graph, a centrality function is a real valued function of the vertices defined as a linear combination of the numbers of the vertices classified according to the distance from a given vertex. Some fundamental properties of the centrality functions and the set of central vertices are summarized.
openaire +1 more source
On b-coloring of central graph of some graphs
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2018 Summary: The \(b\)-chromatic number of \(G\), denoted by \(\varphi(G)\), is the maximum \(k\) for which \(G\) has a \(b\)-coloring by \(k\) colors. A \(b\)-coloring of \(G\) by \(k\) colors is a proper \(k\)-coloring of the vertices of \(G\) such that in each color class \(i\) there exists a vertex \(x_i\) having neighbors in all the other \(k-1 ...
Kalpana, M., Vijayalakshmi, D.
openaire +4 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