Results 51 to 60 of about 143,400 (232)
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
Local colourings and monochromatic partitions in complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2015 We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
R. Lang, M. Stein
semanticscholar +1 more source
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics, 2018 8 pages, several typos ...
Lucas Colucci +3 more
openaire +3 more sources
Completing partial packings of bipartite graphs
Journal of Combinatorial Theory, Series A, 2011 Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \rightarrow \infty$.
Füredi, Zoltán +2 more
openaire +2 more sources
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
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
, 2014 We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex ...
Hatanaka, Tatsuhiko +2 more
core +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
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source