نتایج جستجو برای: bipartite graph
تعداد نتایج: 204373 فیلتر نتایج به سال:
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theore...
A matching covered graph is a nontrivial connected graph in which every edge is in some perfect matching. A matching covered graph G is near-bipartite if it is nonbipartite and there is a removable double ear R such that G−R is matching covered and bipartite. In 2000, C. Little and I. Fischer characterized Pfaffian near-bipartite graphs in terms of forbidden subgraphs [3]. However, their charac...
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices and are adjacent if and only if . Here, we study conditions under which is complete or bipartite. Also, the independence number of is deter...
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simple algorithm that generates a connected bipartite permutation graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected bipartite permutation graphs is proposed....
A graph is 1-extendible if every edge has a 1-factor containing it. A 1-extendible non-bipartite graph G is said to be near bipartite if there exist edges e1 and e2 such that G − {e1, e2} is 1-extendible and bipartite. We characterise the Pfaffian near bipartite graphs in terms of forbidden subgraphs. The theorem extends an earlier characterisation of Pfaffian bipartite graphs.
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph theory: the theorem of Kővári, Sós and Turán on the minimum number of edges in a bipartite graph that has no large independent set, and the theore...
The biclique cover number (resp. biclique partition number) of a graph G, bc(G) (resp. bp(G)), is the least number of bicliques—complete bipartite subgraphs—that are needed to cover (resp. partition) the edges of G. The local biclique cover number (resp. local biclique partition number) of a graph G, lbc(G) (resp. lbp(G)), is the least r such that there is a cover (resp. partition) of the edges...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید