Results 21 to 30 of about 366,766 (262)
Commuting graphs and extremal centralizers
Ars Mathematica Contemporanea, 2013 We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor +3 more
openaire +4 more sources
Harmonic Centrality and Centralization of Some Graph Products
Asian Research Journal of Mathematics, 2022 Harmonic centrality calculates the importance of a node in a network by adding the inverse of the geodesic distances of this node to all the other nodes. Harmonic centralization, on the other hand, is the graph-level centrality score based on the node-level harmonic centrality.
Jose Mari E. Ortega, Rolito G. Eballe
openaire +2 more sources
A Central Local Metric Dimension of Generalized Fan Graph, Generalized Broken Fan Graph, and Cm ⊙ K¯m [PDF]
E3S Web of ConferencesThe central local metric dimension is a new variation of local metric dimension that introduced in 2023. The central local metric dimension is a new concept that enriches research studies in graph theory, especially in the field of metric dimension. This
Listiana Yuni, Susilowati Liliek, Slamin
doaj +1 more source
Artificial Intelligence Chemistry, 2023 The proposed work uses centrality measures based heuristic method to improve the efficiency of the solution for the similarity search problem in molecular chemical graphs by effectively identifying central candidate or representative candidate nodes ...
Nirmala Parisutham
doaj +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
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
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]
Transactions on Combinatorics, 2012 In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj
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 Equitable Coloring of Central Graphs and Total Graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract The notion of equitable coloring was introduced by Meyer in 1973. In this paper we discuss the equitable coloring of certain well known graph families of central graphs and total graphs. We obtain interesting results regarding the equitable chromatic number χ = for the above said graph families.
M. M. Ali Akbar +2 more
openaire +1 more source