Results 31 to 40 of about 1,017,247 (314)

Counting independent sets in tree convex bipartite graphs

Discrete Applied Mathematics, 2017
Min-Sheng Lin
exaly   +2 more sources

Inverses of Bipartite Graphs [PDF]

Combinatorica, 2017
9 pages, 2 ...
Yujun Yang, Dong Ye 0002
openaire   +3 more sources

Outerplane bipartite graphs with isomorphic resonance graphs [PDF]

, 2023
We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Moreover,
Che, Zhongyuan, Tratnik, Niko, Pleteršek, Petra Žigert, Brezovnik, Simon   +3 more
core   +5 more sources

Enumeration of Bipartite Graphs and Bipartite Blocks [PDF]

The Electronic Journal of Combinatorics, 2014
We use the theory of combinatorial species to count unlabelled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group $\mathfrak{S}_2$ acts on these graphs by switching the colors, and connected bipartite graphs
Andrew Gainer-Dewar, Ira M. Gessel
openaire   +3 more sources

Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs [PDF]

Transactions on Combinatorics, 2019
Given a graph $ G $, a graph $ F $ is said to be Ramsey for $ G $ if in every edge coloring of $F$ with two colors, there exists a monochromatic copy of $G$. The minimum number of edges of a graph $ F $ which is Ramsey for $ G $ is called the size-Ramsey
Ramin Javadi, Farideh Khoeini
doaj   +1 more source

Minimum k-critical-bipartite graphs: the irregular case [PDF]

Opuscula Mathematica
We 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, Agnieszka Görlich, Karol Suchan   +2 more
doaj   +1 more source

Cyclability in bipartite graphs [PDF]

Opuscula Mathematica, 2009
Let \(G=(X,Y,E)\) be a balanced \(2\)-connected bipartite graph and \(S \subset V(G)\). We will say that \(S\) is cyclable in \(G\) if all vertices of \(S\) belong to a common cycle in \(G\).
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz   +2 more
doaj   +1 more source

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs [PDF]

, 2020
The problem of computing a maximum weight matching in a bipartite graph is one of the fundamental algorithmic problems that has played an important role in the development of combinatorial optimization and algorithmics. Let G_{w,σ} is a collection of all
Shibsankar Das
core   +1 more source

On bipartite graphs with complete bipartite star complements [PDF]

, 2014
Let G be a bipartite graph with μ as an eigenvalue of multiplicity k>1k>1. We show that if G has Kr,sKr,s(1≤r≤s)(1≤r≤s) as a star complement for μ then k≤s-1k≤s-1; moreover if μ is non-main then k≤s-2k≤s-2 for large enough s .
Rowlinson, Peter
core   +1 more source

New class of integral bipartite graphs with large diameter [PDF]

Transactions on Combinatorics, 2018
In this paper‎, ‎we construct a new class of integral bipartite graphs (not necessarily trees) with large even diameters‎. ‎In fact‎, ‎for every finite set $A$ of positive integers of size $k$ we construct an integral bipartite graph $G$ of diameter $2k$
Alireza Fiuj Laali, Hamid Haj Seyyed Javadi   +1 more
doaj   +1 more source