Results 221 to 230 of about 2,876,957 (249)

The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernardo M. Ábrego, Silvia Fernández-Merchant, Athena Sparks   +2 more
openaire   +3 more sources

Complete bipartite free graphs

Ars Comb., 2003
The authors study the maximum number of edges in a graph of order \(n\) not containing the complete bipartite graph \(K_{t,t}\) as a subgraph. The upper bound in terms of \(n\) and \(t\) together with corresponding sharpness examples is presented.
Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela   +3 more
openaire   +2 more sources

Ramsey Numbers of Complete Bipartite Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meng Liu, Bangwei Du
openaire   +2 more sources

Hall parameters of complete and complete bipartite graphs

Journal of Graph Theory, 2002
AbstractGiven a graph G, for each υ ∈V(G) let L(υ) be a list assignment to G. The well‐known choice number c(G) is the least integer j such that if |L(υ)| ≥j for all υ ∈V(G), then G has a proper vertex colouring ϕ with ϕ(υ) ∈ L (υ) (∀υ ∈V(G)). The Hall number h(G) is like the choice number, except that an extra non‐triviality condition, called Hall's ...
Mathew Cropper, Anthony J. W. Hilton
openaire   +3 more sources

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph

Graphs and Combinatorics, 1999
It is proved that if \(G=(X,Y;E)\) is a bipartite graph with \(|X|=|Y|=4s\), \(s\geq 2\), and the minimum degree of \(G\) is at least \(4s-3\), then \(G\) contains four vertex-disjoint copies of \(K_{s,s}\).
openaire   +1 more source

THE TOTAL IRREGULARITY STRENGTH OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tilukay, M. I., Tomasouw, B. P., Rumlawang, F. Y., Salman, A. N. M.   +3 more
openaire   +2 more sources

Decomposition of complete bipartite graphs

Ars Comb., 1997
The paper starts with the well-known result of A. Rosa from 1966 [Theory Graphs, Int. Symp. Rome 1966, 349-355, Dunod, Paris (1967; Zbl 0193.53204)] on the cyclic decomposition of a complete graph \(K_{2n+1}\) into edge-disjoint copies of a graph \(G\) having \(n\) edges.
openaire   +2 more sources

Complete Graphs and Bipartite Graphs in a Random Graph

2021 5th International Conference on Vision, Image and Signal Processing (ICVISP), 2021
Lijin Feng, Jackson Barr
openaire   +1 more source

On the vulnerability of permutation graphs of complete and complete bipartite graphs

1991
The integrity of a graph \(G\) is defined as \(\min\{| S|+m(G-S)\}\) taken over all subsets \(S\) of \(V(G)\), where \(m(G-S)\) is the order of the largest component of \(G-S\). The toughness of \(G\) is defined as \(\min\{| S|/w(G-S)\}\) taken over all disconnecting subsets \(S\) of \(G\), where \(w(G-S)\) is the number of components of \(G-S\).
Guichard, D., Piazza, Barry L., Stueckle, Sam K.   +2 more
openaire   +1 more source

Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs

2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2018
The difference between its positive inertia index and the negative inertia index of a graph $H$ is noted by $m(H)$ . We use $c_{j}(H)$ is the number of cycles in a graph whose length is $j$ module 4. In 2013, H. Ma, W. Yang and S. Li asserted that $-c_{3}(H)\leq m(H)\leq c_{5}(H)$ for any clear graph $H$ . In this paper, as a continuous of it,
openaire   +1 more source