Bipartite Graphs
Efficient Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
... undirected, bipartite graph, where U and W is a partition of the vertices and E is the edge set in which each edge (u, w) is such that u ∈ U and w ∈ W ...on bipartite graphs has been shown to be ...
5
Bipartite graphs whose edge algebras are complete intersections
... There has been a recent effort to relate the algebraic properties of k[G] with the structure of G. For example, [7] and [4] give a criterion for the normality of k[G] and the authors of the latter recently obtained a ...
16
The structure and the number of $P 7$ free bipartite graphs
... Lemma 3.6. There are at most n O(n) n-vertex labeled chain-decomposable bipartite graphs. Proof. To prove the lemma, we use the fact that for n ≥ 3 any decomposition tree of an n-vertex chain-decomposable ...
15
A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs
... in bipartite graphs, maximum cardinality matching in general graphs, maximum weighted matching in bipartite graphs, and maximum weighted matching in general graphs ...
11
On the spectral radius of bipartite graphs which are nearly complete
... In the literature, upper bounds for the spectral radius in terms of various parameters for unweighted and weighted graphs have been widely investigated [–]. As a special case, in [], Chen et al. studied the ...
5
Colored Saturation Parameters for Bipartite Graphs
... Now, by observations 1 and 2, we can partition the vertex set into two parts: a set X of vertices that see at most k − 2 colors and a set Y that sees exactly k − 1 colors. We can use observation 3 to partition the set Y ...
31
Automorphism Groups Of Weakly Semi-Regular Bipartite Graphs
... of graphs plays an important role in Graph ...of bipartite graphs which are weakly ...of graphs were considered -SM sum graphs and SM Balancing ...sum graphs are particular cases ...
5
The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth
... The embedding of complete bipartite graphs onto grids with a The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth.. minimum grid cutwidth.[r] ...
73
Generalized Matching Preclusion in Bipartite Graphs
... The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal ...
18
Bipartite Toughness and k Factors in Bipartite Graphs
... ε-tough graphs for any ε > 0 that do not contain a ...a bipartite graph G X, Y; E, where X ∪ Y V G is a partition of V G and E is the edge set of G with each edge having one end in X and the other in Y ...
8
Vertex Prime Labeling of Union of Complete Bipartite Graphs
... ABSTRACT: A graph G(V, E) is said to have a vertex prime labeling if its edges can be labeled with distinct integers.. from 1, 2, 3,.[r] ...
7
Multi document Summarization Using Bipartite Graphs
... a bipartite graph repre- sentation of text based on the entity grid (Barzilay and Lapata, 2008) representation of ...this bipartite graph representation has been used for calculating the local coherence of ...
10
A Partial Order on Bipartite Graphs with n Vertices
... the bipartite graph with n vertices, 1,2,…,n, having the basis {1,2,…,m}; and the set of edges being the union of the set of edges of U and the set of those edges of V which have an endpoint in the basis of ...
10
The bounds of crossing number in complete bipartite graphs
... Abstract—We compare the lower bound of crossing number of bipartite and complete bipartite graph with Zarankiewicz conjecture and we illustrate the possible upper bound by a modified Zar[r] ...
7
Mixed cycle-E-super magic decomposition of complete bipartite graphs
... with one isolated vertex, grids and books. Maryati et al. [16] studied the H-super magic labeling of some graphs obtained from k isomorphic copies of a connected graph H. In 2012, Mania Roswitha and Edy Tri ...
16
Algorithmic aspects of bipartite graphs
... so If we take as in Rose and Tarjan [2] an ordering of pivots down the main diagonal F fill-in the then 4 [z,yx,x2,y,...,xs,y], where z,,y corresponds to the entry rn,, of produced by th[r] ...
6
On star polynomials, graphical partitions and reconstruction
... J., On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars, Canad.[r] ...
7
An o(n2 5) Algorithm: For Maximum Matchings in General Graphs
... of bipartite graphs, it is easier to search for augmenting paths using of bread-first ...general graphs were ...non-bipartite graphs by “shrinking” ...
10
Bounds on the number of closed walks in a graph and its applications
... Using graph-theoretical techniques, we establish an inequality regarding the number of walks and closed walks in a graph. This inequality yields several upper bounds for the number of closed walks in a graph in terms of ...
9
Zarankiewicz Numbers and Bipartite Ramsey Numbers
... a bipartite graph, with the bipartition of its vertices V (G) = L(G) ∪ R(G), or simply V = L ∪ R, we will denote it by writing G[L, ...all bipartite graphs have a fixed ...
16