Results 41 to 50 of about 2,715,030 (252)
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
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
Locating-Chromatic Number of Bipartite Graphs
مجلة بغداد للعلومThe locating-chromatic number of a graph combines proper vertex coloring with vertex identification through distances to color classes. Although this parameter has been studied for many graph families, general results for bipartite graphs remain limited.
Dian Kastika Syofyan +5 more
doaj +1 more source
Advances in Materials Science and Engineering, 2023 The application of bipartite and regular graphs plays a vital role in the area of engineering, mathematical sciences, design of experiments, and medical fields.
P. Karthikeyan +4 more
doaj +1 more source
End Behavior of the Threshold Protocol Game on Complete and Bipartite Graphs
GamesThe threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to ...
Alexandra Fedrigo
doaj +1 more source
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source
Universal Rigidity of Complete Bipartite Graphs [PDF]
Discrete & Computational Geometry, 2017 DCG published ...
Robert Connelly, Steven J. Gortler
openaire +2 more sources
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
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