Results 1 to 10 of about 2,876,957 (249)
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Nigel, Nigel Martin
exaly +7 more sources
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
core +9 more sources
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2020 Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain tree. Then we apply the effective resistance (i.e., resistance distance in graphs) to find a formula for the number of spanning trees in the nearly complete bipartite graph $G(
Jun Ge, Fengming Dong
exaly +5 more sources
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics, 2018 8 pages, several typos ...
Ervin Győri +2 more
exaly +5 more sources
-labeling of supersubdivided connected graph plus an edge
AKCE International Journal of Graphs and Combinatorics, 2020 Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +3 more sources
The competition graphs of oriented complete bipartite graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suh-ryung Kim, Yoshio Sano, Boram Park
exaly +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 Subgraphs of the Complete Bipartite Graph [PDF]
Canadian Mathematical Bulletin, 1964 G(n) denotes a graph of n vertices and Ḡ(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let Ck(G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k1where the minimum is over all graphs G(n).
Erdős, Pál, Moon, J. W.
openaire +2 more sources
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