Results 131 to 140 of about 143,400 (232)

Optimal orientations of subgraphs of complete bipartite graphs [PDF]

Transactions on Combinatorics, 2015
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is min {d(D) |D belongs to D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some subgraphs of
R. Lakshmi, G. Rajasekaran, R. Sampathkumar   +2 more
doaj  

Topological Ramsey Theorem for Complete Bipartite Graphs

Journal of Combinatorial Theory, Series B, 1994
An embedding of a graph into a space is linear if each edge is a straight line segment. In 1991, \textit{S. Negami} [Trans. Am. Math. Soc. 324, No. 2, 527-541 (1991; Zbl 0721.57004)] showed that for any given knot, link, or spatial graph there is a sufficiently large complete graph \(K_ n\) such that every linear embedding of \(K_ n\) into a space ...
openaire   +1 more source

Sharp Choice Number Thresholds for Complete Bipartite Graphs

Axioms
Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold ...
Julian Allagan, Benkam Bobga, Jianning Su, Weizheng Gao, Shanzhen Gao   +4 more
doaj   +1 more source

Partitioning Complete Bipartite Graphs by Monochromatic Cycles

Journal of Combinatorial Theory, Series B, 1997
For every positive integer \(r\) there exists a constant \(C_r\) depending only on \(r\) such that for every colouring of the edges of the complete bipartite graph \(K^{n,n}\) with \(r\) colours, there exists a set of at most \(C_r\) monochromatic cycles whose vertex sets partition the vertex set of \(K^{n,n}\).
openaire   +1 more source

On the Graph Isomorphism Completeness of Directed and Multidirected Graphs

Mathematics
The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra, Vivek Kurien George, Gabriel A. Silva   +2 more
doaj   +1 more source

On the spectrum of some signed complete and complete bipartite graphs

, 2018
S. Akbari, H. Maimani, L. P. Majd
semanticscholar   +1 more source

Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. [PDF]

Heliyon
Mari B, Jeyaraj RS.
europepmc   +1 more source

Efficient classical sampling from Gaussian boson sampling distributions on unweighted graphs. [PDF]

Nat Commun
Zhang Y, Zhou S, Wang X, Wang Z, Yang Z, Yang R, Xue Y, Li T.   +7 more
europepmc   +1 more source

From graph theory to chemoinformatics: modified bond-based indices and a hypothesis-driven multi-task QSAR/QSPR benchmark. [PDF]

Sci Rep
Altairi A, Alhaj Z, Alsharafi M, Zeren Y.   +3 more
europepmc   +1 more source

Factorization norms and an inverse theorem for MaxCut. [PDF]

Math Ann
Balla I, Hambardzumyan L, Tomon I.
europepmc   +1 more source