Results 111 to 120 of about 5,793,190 (230)
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
wiley +1 more source
Indonesian Journal of Combinatorics, 2018 An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj +1 more source
Hamiltonian Decomposition of Lexicographic Products of Digraphs
Journal of Combinatorial Theory, Series B, 1998 We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in general.
openaire +1 more source
Minimum cycle bases of lexicographic products
Ars Mathematica Contemporanea, 2012 Minimum cycle bases of product graphs can in most situations be constructed from minimum cycle bases of the factors together with a suitable collection of triangles and/or quadrangles determined by the product operation. Here we give an explicit construction for the lexicographic product G o H that generalizes results by Berger and Jaradat to the case ...
Hellmuth, Marc +2 more
openaire +3 more sources
Lexikos, 2011 <p>ABSTRACT: The publication of a dictionary is regarded as the result of a lexicographic process. Three subtypes of a lexicographic process have been noted, namely the primary comprehensive, the secondary comprehensive and the dictionary specific ...
Mbulungeni Madiba, Dion Nkomo
doaj +1 more source
On local antimagic chromatic number of lexicographic product graphs
Acta Mathematica Hungarica, 2023 G. Lau, W. Shiu
semanticscholar +1 more source
Choosability and paintability of the lexicographic product of graphs
Discrete Applied Mathematics, 2017 This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if $G$ has maximum degree $Δ$, then for any graph $H$ on $n$ vertices $ch(G[H]) \le (4Δ+2)(ch(H) +\log_2 n)$ and $χ_P(G[H]) \le (4Δ+2) (χ_P(H)+ \log_2 n)$.
Balázs Keszegh, Xuding Zhu
openaire +4 more sources
Bounds for DNA codes with constant GC-content
, 2003 We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword ...
King, Oliver D.
core +3 more sources
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2016 Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota +2 more
doaj +1 more source
Infinite lexicographic products of positional objectives
CoRRThis paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, TheoretiCS 2023] established that positionality of prefix-independent objectives is preserved by finite lexicographic products.
Antonio Casares +3 more
openaire +2 more sources