Results 21 to 30 of about 2,715,030 (252)
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.
Bojan Mohar +3 more
openaire +4 more sources
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source
Decomposition of Random Graphs into Complete Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2016 We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $τ(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than $1/2$, almost surely $τ(G)$ is between $n- c(\ln_{1/p} n)^{3+ε}$ and $n - 2\ln_{1/(1-p)} n$ for any positive constants $c$
Fan Chung, Xing Peng
openaire +2 more sources
Minimum k-critical-bipartite graphs: the irregular case [PDF]
Opuscula MathematicaWe study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz +2 more
doaj +1 more source
Bounds for the Kirchhoff Index of Bipartite Graphs
Journal of Applied Mathematics, 2012 A -bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell consists of the path together with a independent vertices adjacent to one pendent vertex of and b independent ...
Yujun Yang
doaj +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Proportional Choosability of Complete Bipartite Graphs [PDF]
Graphs and Combinatorics, 2020 11 ...
Jeffrey A. Mudrock +3 more
openaire +4 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
Linear structure of bipartite permutation graphs and the longest path problem [PDF]
, 2007 The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note.
Valiente, Gabriel, Uehara, Ryuhei
core +1 more source