Results 41 to 50 of about 6,572,416 (223)
Commuting Conjugacy Class Graph of G when G / Z(G)~=D2n [PDF]
Mathematics Interdisciplinary Research, 2020 Suppose G is a finite non-abelian group and Γ(G) is a simple graph with the non-central conjugacy classes of G as its vertex set. Two different noncentral conjugacy classes C and B are assumed to be adjacent in Γ(G) if and only if there are elements a ...
Mohammad Ali Salahshour
doaj +1 more source
Approximation Algorithms for Partially Colorable Graphs [PDF]
, 2019 Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For alpha = alpha |V| such that the graph induced on S is k-colorable.
Ghoshal, Suprovat +2 more
core +2 more sources
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
Graph Manipulations for Fast Centrality Computation
ACM Transactions on Knowledge Discovery from Data, 2017 The betweenness and closeness metrics are widely used metrics in many network analysis applications. Yet, they are expensive to compute. For that reason, making the betweenness and closeness centrality computations faster is an important and well-studied problem.
Sarıyüce, Ahmet Erdem +3 more
openaire +4 more sources
SpreadGNN: Decentralized Multi-Task Federated Learning for Graph Neural Networks on Molecular Data
AAAI Conference on Artificial Intelligence, 2022 Graph Neural Networks (GNNs) are the first choice methods for graph machine learning problems thanks to their ability to learn state-of-the-art level representations from graph-structured data.
Chaoyang He +4 more
semanticscholar +1 more source
Annealed central limit theorems for the Ising model on random graphs [PDF]
, 2015 The aim of this paper is to prove central limit theorems with respect to the annealed measure for the magnetization rescaled by $\sqrt{N}$ of Ising models on random graphs.
Giardinà, Cristian +3 more
core +4 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
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
Sublinear Algorithms for Local Graph-Centrality Estimation [PDF]
SIAM Journal on Computing, 2018 We study the complexity of local graph centrality estimation, with the goal of approximating the centrality score of a given target node while exploring only a sublinear number of nodes/arcs of the graph and performing a sublinear number of elementary operations.
Bressan, Marco +2 more
openaire +2 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.
Ortega, Jose Mari E., Eballe, Rolito G.
openaire +2 more sources