Results 201 to 210 of about 143,400 (232)

Rotation numers for complete bipartite graphs

Journal of Graph Theory, 1991
AbstractA rooted graph is a pair (G, x) where G is a simple undirected graph and x ϵ V(G). If G if rooted at x, then its rotation number h(G, x) is teh minimum number of edges in a graph F, of the same order as G, such that for all v ϵ V(F) we can find a copy of G in F with the root x at v.
Haviland, Julie, Thomason, Andrew
openaire   +2 more sources

Pagenumber of complete bipartite graphs

Journal of Graph Theory, 1988
AbstractGiven an ordering of the vertices of a graph around a circle, a page is a collection of edges forming noncrossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. Thepagenumber t(G)(also called book thickness) is the minimum number of pages in a book embedding of G. We present
Muder, Douglas J., Lefevre Weaver, Margaret, West, Douglas B.   +2 more
openaire   +2 more sources

EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture

Adaptive Agents and Multi-Agent Systems
We consider the fundamental problem of fairly allocating a set of indivisible items among agents having valuations that are represented by a multi-graph -- here, agents appear as the vertices and items as the edges between them and each vertex (agent ...
Mahyar Afshinmehr, Alireza Danaei, Mehrafarin Kazemi, Kurt Mehlhorn, Nidhi Rathi   +4 more
semanticscholar   +1 more source

THE TOTAL IRREGULARITY STRENGTH OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tilukay, M. I., Tomasouw, B. P., Rumlawang, F. Y., Salman, A. N. M.   +3 more
openaire   +2 more sources

C k -factorization of complete bipartite graphs

Graphs and Combinatorics, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enomoto, Hikoe, Miyamoto, Takashi, Ushio, Kazuhiko   +2 more
openaire   +2 more sources

Decomposition of complete graphs into isomorphic complete bipartite graphs

2013
Summary: A decomposition of a complete graph \(K\) into disjoint copies of a complete bipartite graph \(K_{s,t}\) is called a \(K_{s,t}\)-design of order \(n\). The existence problem of \(K_{s,t}\)-designs has been completely solved for the graphs \(K_{1,t}\) for \(k\geq 1\), \(K_{2^{a},2^{b}}\) for \(a,b\geq 1\), \(K_{2, 3}\) and \(K_{3, 3}\). In this
openaire   +2 more sources

Bipartite graphs and completely 0-simple semigroups

Semigroup Forum, 2011
With any completely 0-simple semigroup \(S\), represented as a Rees matrix semigroup \(\mathcal M^0(I,G,\Lambda,P)\), the author associates the bipartite graph \(\Gamma(S)\), the vertex set of which is \(I\cup\Lambda\), the edge set consisting of the pairs \((i,\lambda)\) for which \(p_{\lambda i}\neq 0\).
openaire   +2 more sources

Gallai–Ramsey Numbers of Odd Cycles and Complete Bipartite Graphs

Graphs and Combinatorics, 2018
Ming Chen, Yusheng Li, Chaoping Pei
semanticscholar   +1 more source

Anti-Ramsey coloring for matchings in complete bipartite graphs

Journal of combinatorial optimization, 2017
Zemin Jin, Yuping Zang
semanticscholar   +1 more source

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs

Discrete Applied Mathematics, 2020
Jun Ge, Fengming Dong
exaly