Results 21 to 30 of about 96,628 (243)
BIPARTITE STEINHAUS GRAPHS [PDF]
A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire +4 more sources
Rainbow perfect matchings in r-partite graph structures [PDF]
A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources
Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +1 more source
Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang +4 more
doaj +1 more source
Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\)
Takayuki Hibi, Hidefumi Ohsugi
openaire +3 more sources
Enumeration of Bipartite Graphs and Bipartite Blocks [PDF]
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
Ira M. Gessel, Andrew Gainer-Dewar
openaire +3 more sources
Bounds for the Kirchhoff Index of Bipartite Graphs
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
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding ...
S. El-Serafi +2 more
doaj +1 more source
On the deficiency of bipartite graphs
An edge-coloring of a graph \(G\) with colors \(1,2,3,\dots\) is consecutive if the set of colors present at each vertex of \(G\) is a consecutive set of integers. For a bipartite graph \(G\), a consecutive edge-coloring has an application in scheduling and thus had been studied before by A. S. Asratian, R. R. Kamalian, D. Hanson, C. O. M.
Krzysztof Giaro +2 more
openaire +2 more sources
A Note on a Binary Relation Corresponding to a Bipartite Graph
In this paper, we firstly define a binary relation corresponding to the bipartite graph and study its properties. We also establish a relationship between the independent sets of the bipartite graph and the definable sets of binary relations ...
Sarı Hatice Kübra, Kopuzlu Abdullah
doaj +1 more source

