Results 51 to 60 of about 96,090 (258)
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
Complete bipartite factorisations by complete bipartite graphs
Discrete Mathematics, 1997 Let \(K_{m,n}\) be the complete bipartite graph on sets of size \(m\) and \(n\). A \(K_{p,q}\)-factor of \(K_{m,n}\) is a spanning subgraph of \(K_{m,n}\) which is a union of vertex-disjoint subgraphs each isomorphic to \(K_{p,q}\). If \(K_{m,n}\) is expressed as a edge-disjoint union of \(K_{p,q}\)-factors, then this union is called a \(K_{p,q ...
openaire +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
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
On the spectrum of some signed complete and complete bipartite graphs
, 2018 In this paper, we obtain the spectrum of signed complete and complete bipartite graphs whose negative edges form a matching. Moreover, we construct a family of signed complete graphs having symmetric spectrum.
S. Akbari, H. Maimani, L. P. Majd
semanticscholar +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced Materials, EarlyView.Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +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
Data‐Driven Materials Science for Energy‐Sustainable Applications
Advanced Materials, EarlyView.Data‐driven approaches powered by artificial intelligence are transforming materials discovery for energy sustainability. This review examines how auto‐generated high‐quality materials databases and domain‐specific language models accelerate research in photovoltaics, thermoelectrics, batteries and magnetic materials. Applications involve extraction of
Jacqueline M. Cole
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