Results 21 to 30 of about 143,400 (232)
The local vertex anti-magic coloring for certain graph operations [PDF]
HeliyonThis work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
doaj +2 more sources
Note on group distance magic complete bipartite graphs [PDF]
Open Mathematics, 2014 A Γ-distance magic labeling of a graph G = (V, E) with |V| = n is a bijection ℓ from V to an Abelian group Γ of order n such that the weight $$w(x) = \sum\nolimits_{y \in N_G (x)} {\ell (y)}$$ of every vertex x ∈ V is equal to the same element µ ∈ Γ ...
Cichacz Sylwia
doaj +2 more sources
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs [PDF]
European journal of combinatorics (Print), 2021 Nikiforov (2002) showed that if G is K r + 1 -free then the spectral radius ρ ( G ) ≤ 2 m ( 1 − 1 ∕ r ) , which implies that G contains C 3 if ρ ( G ) > m .
M. Zhai, Huiqiu Lin, Jinlong Shu
semanticscholar +1 more source
Packing Colourings in Complete Bipartite Graphs and the Inverse Problem for Correspondence Packing [PDF]
Journal of Graph Theory, 2023 Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.
Stijn Cambie, Rimma Hämäläinen
semanticscholar +1 more source
Cutoff for the averaging process on the hypercube and complete bipartite graphs [PDF]
Electronic Journal of Probability, 2022 We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes.
P. Caputo +2 more
semanticscholar +1 more source
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +4 more sources
The competition graphs of oriented complete bipartite graphs
Discrete Applied Mathematics, 2016 Suh-Ryung Kim +3 more
semanticscholar +3 more sources
Proportional Choosability of Complete Bipartite Graphs [PDF]
Graphs and Combinatorics, 2020 11 ...
Jeffrey A. Mudrock +3 more
openaire +3 more sources
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source
A Note on the Equitable Choosability of Complete Bipartite Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2018 In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A k-assignment, L, for a graph G assigns a list, L(v), of k available colors to each v ∈ V (G), and an equitable L-coloring of G is a ...
Madelynn Chase +4 more
semanticscholar +1 more source