Betweenness centrality (BC) was proposed as an indicator of the extent individual's influence in a social network. It is measured by counting how many times vertex (i.e., individual) appears on all shortest paths between pairs vertices. A question naturally arises to team or group network can be measured. Here, we propose method measuring this bipartite graph comprising vertices (individuals) a...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...

In a recent article, Zachary Neal (2011) distinguishes between centrality and power in world city networks and proposes two measures of recursive power and centrality. His effort to clarify oversimplistic interpretations of relational measures of power and position in world city networks is appreciated. However, Neal’s effort to innovate methodologically is based on theoretical reasoning that i...

Group centrality is an extension of the classical notion of centrality for individuals, to make it applicable to sets of them. We perform a SWOT (strengths, weaknesses, opportunities and threats) analysis of the use of group centrality in semantic networks, for different centrality notions: degree, closeness, betweenness, giving prominence to random walks. Among our main results stand out the r...

Computing the semantic similarity between terms relies on existence and usage of semantic resources. However, these resources, often composed of equivalent units, or synonyms, must be first analyzed and weighted in order to define within them the reliability zones where the semantic cohesiveness is stronger. We propose an original method for acquisition of elementary synonyms based on exploitat...

One of the fundamental algorithms in analytical graph databases is breadth-first search (BFS). It is the basis of reachability queries, centrality computations, neighborhood enumeration, and many other commonly-used algorithms. We take the idea of purely array-based BFSs introduced in the sequential multi-source MS-BFS algorithm and extend this approach tomulti-threaded singleandmulti-source BF...

Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative, and neutral networks according to the behavior of the degree-degree correlation coefficient. Here we investigate the betweenness centrality (BC) correlation for each type of SF networks. While the BC-BC correlation coefficients behave similarly to the degree-degree correlation ...

The three sequences of binary gluonic mesons (gb) are reviewed , , represented by the respective gb resonances with lowest mass and J quantum numbers : 0, 0 and 2. While the 2 sequence is associated through Regge analytic continuation in angular momentum of two body elastic amplitudes to the Pomeron trajectory, the triple Pomeron vertex is thought to be responsible for the multiparticle product...