Results 251 to 260 of about 85,296 (298)

Complete bipartite graphs deleted in Ramsey graphs

Theoretical Computer Science, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Yan, Li, Yusheng, Wang, Ye
openaire   +2 more sources

Unavoidable induced subgraphs in graphs with complete bipartite induced minors

SIAM Journal on Discrete Mathematics
We prove that if a graph contains the complete bipartite graph $K_{134, 12}$ as an induced minor, then it contains a cycle of length at most~12 or a theta as an induced subgraph.
Maria Chudnovsky, Meike Hatzel, T. Korhonen, Nicolas Trotignon, Sebastian Wiederrecht   +4 more
semanticscholar   +1 more source

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

Complete graphs and complete bipartite graphs without rainbow path

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xihe Li, Ligong Wang, Xiangxiang Liu
openaire   +1 more source

An operational matrix based on the Independence polynomial of a complete bipartite graph for the Caputo fractional derivative

SeMA Journal, 2021
Chandrali Baishya
semanticscholar   +1 more source

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

Internally disjoint trees in the line graph and total graph of the complete bipartite graph

Applied Mathematics and Computation, 2022
Shu-Li Zhao, Rongxia Hao, Chao Wei
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

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

Cospectrality of complete bipartite graphs

Linear and Multilinear Algebra, 2016
Richard Brualdi proposed in [Research problems from the Aveiro workshop on graph spectra, Linear Algebra Appl. 2007;423:172–181] the following problem: (Problem AWGS.4) Let and be two non-isomorphic graphs on n vertices with spectrarespectively. Define the distance between the spectra of and asDefine the cospectrality of byLetProblem AInvestigate for ...
openaire   +1 more source