Results 11 to 20 of about 153,964 (249)
IEEE Access, 2019 Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang +4 more
doaj +3 more sources
On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
SIAM Journal on Applied Dynamical Systems, 2009 M. Verwoerd, O. Mason
semanticscholar +3 more sources
Proportional Choosability of Complete Bipartite Graphs [PDF]
Graphs and Combinatorics, 2020 11 ...
Jeffrey A. Mudrock +3 more
openaire +3 more sources
Cycle systems in the complete bipartite graph minus a one-factor
Discrete Mathematics, 2004 D. Archdeacon +3 more
semanticscholar +3 more sources
Journal of Function Spaces, 2022 Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +1 more source
Complete bipartite graph is a totally irregular total graph
Electronic Journal of Graph Theory and Applications, 2021 A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are distinct,
Meilin I. Tilukay +4 more
doaj +1 more source
On bipartite divisor graph for character degrees [PDF]
International Journal of Group Theory, 2017 The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95--105.].
Seyed Ali Moosavi
doaj +1 more source
Local equivalence of complete bipartite and repeater graph states [PDF]
Physical Review A, 2018 Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement.
I. Tzitrin
semanticscholar +1 more source
Interval Minors of Complete Bipartite Graphs [PDF]
Journal of Graph Theory, 2015 AbstractInterval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley–Wilf limits. We investigate the maximum number of edges in ‐interval minor‐free bipartite graphs. We determine exact values when and describe the extremal graphs.
Mohar, Bojan +3 more
openaire +3 more sources
Weak saturation numbers of K2 , t and K p ⋃ K q
AKCE International Journal of Graphs and Combinatorics, 2019 A graph G is weakly F-saturated if G contains no copy of F, and there is an ordering of all edges of G¯so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of F.
Yajuan Cui, Liqun Pu
doaj +2 more sources