Results 31 to 40 of about 366,766 (262)
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
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
Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths
International Journal of Mathematics and Mathematical Sciences, 2011 The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number 𝜒= for the total graph of complete bigraphs 𝑇(𝐾𝑚,𝑛), the central graph of cycles 𝐶(𝐶𝑛) and the central ...
J. Vernold Vivin +2 more
doaj +1 more source
HARMONIC CENTRALIZATION OF SOME GRAPH FAMILIES
Advances and Applications in Discrete Mathematics, 2022 21 pages, 5 figures.
Jose Mari E. Ortega, Rolito G. Eballe
openaire +3 more sources
Mapping graph state orbits under local complementation [PDF]
Quantum, 2020 Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation – the graph operation that links all local-Clifford equivalent graph states – allows us to classify all ...
Jeremy C. Adcock +3 more
doaj +1 more source
Betweenness centrality in Cartesian product of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2017 Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the network under the assumption that information primarily flows over the shortest paths between them.
Sunil Kumar R., Kannan Balakrishnan
openaire +4 more sources
On diameters estimations of the commuting graphs of Sylow $p$-subgroups of the symmetric groups
Karpatsʹkì Matematičnì Publìkacìï, 2013 The commuting graph of a group $G$ is an undirected graph whose vertices are non-central elements of $G$ and two distinct vertices $x,y$ are adjacent if and only if $xy=yx$.
Yu.Yu. Leshchenko, L.V. Zoria
doaj +3 more sources
Isolation Number of Transition Graphs
MathematicsLet G=(V,E) be a graph and F be a family of graphs; a subset (S⊆V(G)) is said to be an F-isolating set if G[V(G)∖NG[S]] does not contain F as a subgraph for all F∈F.
Junhao Qu, Shumin Zhang
doaj +1 more source
Commuting Conjugacy Class Graph of The Finite $2-$Groups $G_n(m)$ and $G[n]$ [PDF]
Journal of Mahani Mathematical ResearchSuppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a graph with non-central conjugacy classes of $G$ as its vertex set. Two vertices $L$ and $K$ in $\Gamma(G)$ are adjacent if there are $a \in L$ and $b \in K$ such that $ab = ba$.
Mohammad Ali Salahshour +1 more
doaj +1 more source
Graph Manipulations for Fast Centrality Computation [PDF]
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.
Ahmet Erdem Sariyüce +3 more
openaire +3 more sources