Results 61 to 70 of about 9,811 (181)
Another H-super magic decompositions of the lexicographic product of graphs
Indonesian Journal of Combinatorics, 2018 Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection
H Hendy +3 more
doaj +1 more source
Coding and anticoding of a cardinal by bounded subsets of the cardinal
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract This paper will consider combinatorial properties related to coding a cardinal by its bounded subsets. These properties have traditionally been studied in the context of very large cardinals and variations of these properties either reach the level of Kunen inconsistency or are very close to it.
William Chan
wiley +1 more source
Coloring and density theorems for configurations of a given volume
Proceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.Abstract This is a treatise on finite point configurations spanning a fixed volume to be found in a single color‐class of an arbitrary finite (measurable) coloring of the Euclidean space Rn$\mathbb {R}^n$, or in a single large measurable subset A⊆Rn$A\subseteq \mathbb {R}^n$.
Vjekoslav Kovač
wiley +1 more source
Strategic Flip‐Flopping in Political Competition
International Economic Review, Volume 67, Issue 1, Page 79-96, February 2026.ABSTRACT We study candidates' position adjustments in response to information about voters' preferences. Repositioning allows candidates to move closer to the median voter, but it incurs financial and electoral costs. In a subgame‐perfect equilibrium, candidates diverge from the center ex ante if the costs of adjustment are sufficiently large.
Gaëtan Fournier +2 more
wiley +1 more source
Perfect state transfer, graph products and equitable partitions [PDF]
, 2010 We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which includes the n ...
Ge, Yang +3 more
core
Zero‐free regions for the independence polynomial on restricted graph classes
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract Generalising the Heilmann–Lieb theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97 (2007), no. 3, 350–357] showed that the univariate independence polynomial of any claw‐free graph has all of its zeros on the negative real line. In this paper, we show that for any fixed subdivided claw H$H$ and any Δ$\Delta$,
Mark Jerrum, Viresh Patel
wiley +1 more source
Efficient Open Domination in Digraph Products
Mathematics, 2020 A digraph D is an efficient open domination digraph if there exists a subset S of V ( D ) for which the open out-neighborhoods centered in the vertices of S form a partition of V ( D ) .
Dragana Božović, Iztok Peterin
doaj +1 more source
F‐purity of binomial edge ideals
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In 2012, Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F‐pure. He proved that weakly closed binomial edge ideals are F‐pure whenever the base field has positive characteristic. He conjectured that: (i) when the base field has characteristic 2, every F‐pure binomial edge ideal comes from a ...
Adam LaClair, Jason McCullough
wiley +1 more source
On the indices of certain graph products [PDF]
Transactions on CombinatoricsMolecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point ...
Ishita Sarkar, Manjunath Nanjappa
doaj +1 more source
Dominating sequences in grid-like and toroidal graphs [PDF]
, 2016 A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy dominating sequence; the length of $S$ is the Grundy domination number of $G$
Brešar, Boštjan +7 more
core +1 more source