Resistance between two vertices of almost complete bipartite graphs
Discrete Applied Mathematics, 2019 The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let G ( n , p ) = K n , n − p K 2 ( p ≤ n ) be the almost complete bipartite graph.
Weigen Yan
exaly +2 more sources
Universal Rigidity of Complete Bipartite Graphs [PDF]
Discrete & Computational Geometry, 2015 We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework (K(n,m),p,q)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage ...
R. Connelly, S. Gortler
semanticscholar +4 more sources
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics, 2018 8 pages, several typos ...
Ervin Gyori +2 more
exaly +4 more sources
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
Ain Shams Engineering Journal, 2015 Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding ...
S. El-Serafi +2 more
doaj +2 more sources
Complexity of Products of Some Complete and Complete Bipartite Graphs
Journal of Applied Mathematics, 2013 The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete ...
S. N. Daoud
doaj +2 more sources
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2021 Nikiforov (2002) showed that if G is K r + 1 -free then the spectral radius ρ ( G ) ≤ 2 m ( 1 − 1 ∕ r ) , which implies that G contains C 3 if ρ ( G ) > m .
M. Zhai, Huiqiu Lin, Jinlong Shu
semanticscholar +1 more source
Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing [PDF]
Journal of Graph Theory, 2023 Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.
Stijn Cambie, Rimma Hämäläinen
semanticscholar +1 more source
Cutoff for the averaging process on the hypercube and complete bipartite graphs [PDF]
Electronic Journal of Probability, 2022 We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes.
P. Caputo +2 more
semanticscholar +1 more source
Weak saturation numbers of complete bipartite graphs in the clique [PDF]
Journal of Combinatorial Theory, 2020 The notion of weak saturation was introduced by Bollobas in 1968. Let $F$ and $H$ be graphs. A spanning subgraph $G \subseteq F$ is weakly $(F,H)$-saturated if it contains no copy of $H$ but there exists an ordering $e_1,\ldots,e_t$ of $E(F)\setminus E(G)
Gal Kronenberg +2 more
semanticscholar +1 more source