Results 231 to 240 of about 366,766 (262)
Some of the next articles are maybe not open access.
A Graph-theoretic perspective on centrality
Social Networks, 2006The concept of centrality is often invoked in social network analysis, and diverse indices have been proposed to measure it. This paper develops a unified framework for the measurement of centrality. All measures of centrality assess a node's involvement in the walk structure of a network.
Stephen P. Borgatti, Martin G. Everett
openaire +2 more sources
Centrality for graphs with numerical attributes
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, 2015Identification of important actors in social networks is a hard task but with various interesting applications such as in information recommendation or for viral marketing. Existing centrality measures evaluate the importance of an actor in considering only the structural positions regardless of prior information on these actors such as their ...
Oualid Benyahia, Christine Largeron
openaire +1 more source
Vertex betweenness centrality of corona graphs and unicyclic graphs
2023Summary: The idea of centrality measurements is quite appropriate for determining the important vertices or edges in a network. A vertex in a network may be an important vertex depending on its angle of assumption. There are many centrality measurements to find the characteristics of a vertex in a network. Betweenness centrality is an important variant
Barman, Sambhu Charan +2 more
openaire +1 more source
Testing centralization in random graphs
Social Networks, 2004Centrality is an important concept in social network analysis which involves identification of important or prominent actors. Three common definitions of centrality are degree centrality, closeness centrality and betwenness centrality which yield actor indices.
openaire +1 more source
On central spanning trees of a graph
1996We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal.
Sergei L. Bezrukov +2 more
openaire +1 more source
On the centrality of vertices of molecular graphs
Journal of Computational Chemistry, 2013For acyclic systems the center of a graph has been known to be either a single vertex of two adjacent vertices, that is, an edge. It has not been quite clear how to extend the concept of graph center to polycyclic systems. Several approaches to the graph center of molecular graphs of polycyclic graphs have been proposed in the literature. In most cases
Milan Randic +3 more
openaire +4 more sources
Graphs with equidistant central nodes [PDF]
Australas. J Comb., 1996 A graph \(G\) is called an \(F\)-graph if it admits at least two central nodes and any pair of central nodes are at maximal distance (i.e. the radius of \(G)\) from each other. This paper presents several structural properties of \(F\)-graphs leading to the construction of \(F\)-graphs with any prescribed structure for their center and further ...
openaire +1 more source
CLOSENESS CENTRALITY IN GRAPH PRODUCTS
Advances and Applications in Discrete Mathematics, 2023Eballe, R. G. +7 more
openaire +1 more source
On the centrality in a directed graph
Social Science Research, 1973Abstract The concept of structural centrality in a weakly connected digraph is considered. Some requirements for the pointcentrality and for the centrality index are proposed and a construction satisfying the requirements is given. Several examples are calculated.
openaire +1 more source
A Central Difference Graph Convolutional Operator for Skeleton-Based Action Recognition
IEEE Transactions on Circuits and Systems for Video Technology, 2022Yonghong Hou, Zhimin Gao, Wanqing Li
exaly