Results 51 to 60 of about 2,876,957 (249)
On bipartite graphs with complete bipartite star complements
, 2014 Let G be a bipartite graph with μ as an eigenvalue of multiplicity k>1k>1. We show that if G has Kr,sKr,s(1≤r≤s)(1≤r≤s) as a star complement for μ then k≤s-1k≤s-1; moreover if μ is non-main then k≤s-2k≤s-2 for large enough s .
Rowlinson, Peter
core +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
Annihilating Graph of Abelian Groups
پژوهشهای ریاضی, 2021 In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj
Minimum k-critical-bipartite graphs: the irregular case [PDF]
Opuscula MathematicaWe study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz +2 more
doaj +1 more source
Decomposition of complete bipartite graphs into cycles and stars with four edges
AKCE International Journal of Graphs and Combinatorics, 2020 Let Ck, Sk denote a cycle, star with k edges and let Km,n denotes a complete bipartite graph with m and n vertices in the parts. In this paper, we obtain necessary and sufficient conditions for the existence of a decomposition of complete bipartite ...
M. Ilayaraja, A. Muthusamy
doaj +1 more source
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs [PDF]
Czechoslovak Mathematical Journal, 1983 Let B be a bipartite graph on the vertex sets C, D. A homomorphism \(\phi\) of B onto a complete bipartite graph \(K_{r,s}\) is said to be bicomplete if \(\phi(x)=\phi(y)\) only if either both x, y belong to C, or both x, y belong to D. For a connected bipartite graph B, the author defines the parameter \(\beta_ 0(B)\) as the supremum of all values of ...
openaire +2 more sources
FEBS Open Bio, EarlyView.Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata +3 more
wiley +1 more source
Decomposing dense bipartite graphs into 4-cycles [PDF]
, 2015 Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh +1 more
core
On the Line Graph of the Complete Bipartite Graph
The Annals of Mathematical Statistics, 1964 In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question had been settled by Shrikhande [5] (see also [1], [2] and [3]), who proved that the answer was yes ...
openaire +3 more sources
Advanced Engineering Materials, EarlyView.This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani +7 more
wiley +1 more source