English
Related papers

Related papers: A new labeling construction from the $\otimes_h$-p…

200 papers

Let $D$ be a digraph, possibly with loops. A queen labeling of $D$ is a bijective function $l:V(G)\longrightarrow \{1,2,\ldots,|V(G)|\}$ such that, for every pair of arcs in $E(D)$, namely $(u,v)$ and $(u',v')$ we have (i) $l(u)+l(v)\neq…

Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_h$-product is a generalization of the direct product of digraphs. In this paper we use the $\otimes_h$-product and super…

Combinatorics · Mathematics 2015-11-20 Susana-Clara López , Francesc-Antoni Muntaner-Batle

Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…

Discrete Mathematics · Computer Science 2009-09-29 Alain Bretto , Yannick Silvestre , Thierry Vallée

A new product construction of graphs and digraphs, based on the standard box product of graphs and called the separated box product, is presented, and several of its properties are discussed. Questions about the symmetries of the product…

Combinatorics · Mathematics 2015-11-03 Primož Potočnik , Stephen Wilson

The weak tensor product was introduced by Snevily as a way to construct new graphs that admit $\alpha$-labelings from a pair of known $\alpha$-graphs. In this article, we show that this product and the application to $\alpha$-labelings can…

Combinatorics · Mathematics 2014-08-01 Susana-Clara López , Francesc-Antoni Muntaner-Batle

Stanley's theorem establishes that for any finite graph $G$, the number $h_G(s)$ of magic labelings with magic sum $s$ can be expressed as a sum of two polynomials in $s$. However, determining the precise form of $h_G(s)$ is generally…

Combinatorics · Mathematics 2026-03-11 Guoce Xin , Yueming Zhong , Yangbiao Zhou

Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…

Classical Analysis and ODEs · Mathematics 2024-01-05 Ron Ofir , Michael Margaliot

A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…

Algebraic Topology · Mathematics 2015-03-17 A. Bahri , M. Bendersky , F. R. Cohen , S. Gitler

Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles,…

Combinatorics · Mathematics 2021-12-10 Jelena Djokić , Olga Bodroža-Pantić , Ksenija Doroslovački

A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave…

Combinatorics · Mathematics 2021-07-08 Guoce Xin , Xinyu Xu , Chen Zhang , Yueming Zhong

We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…

Combinatorics · Mathematics 2026-04-14 Josaphat Baolahy , Randrianirina Benjamin

A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…

Representation Theory · Mathematics 2010-09-20 Mikhail Khovanov

We describe symbolic constructions for listing and enumerating graphs having the same induced edge label sequence. We settle in the affirmative R. Whitty's [W08] conjectured existence of determinantal constructions for listing and…

Combinatorics · Mathematics 2020-05-01 Edinah K. Gnang , Isaac Wass

We first summarize joint work on several preliminary canonical Lambert series factorization theorems. Within this article we establish new analogs to these original factorization theorems which characterize two specific primary cases of the…

Number Theory · Mathematics 2017-12-05 Maxie D. Schmidt

In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…

Combinatorics · Mathematics 2015-12-24 Yong Zhang , Kejun Chen , Wen Li

Labels and tags are accompanying us in almost each moment of our life and everywhere we are going, in the form of electronic keys or money, or simply as labels on products we are buying in shops and markets. The label diffusion, rapidly…

Popular Physics · Physics 2008-01-18 Amelia Sparavigna

A new concept of meromorphic $\Sigma$-factorization, for H\"{o}lder continuous functions defined on a contour $\Gamma$ that is the pullback of $\dot{\mathbb{R}}$ (or the unit circle) in a Riemann surface $\Sigma$ of genus 1, is introduced…

Complex Variables · Mathematics 2011-08-03 M. C. Câmara , M. T. Malheiro

In this work, we revisit prefix sums through the lens of linear algebra. We describe an identity that decomposes triangular all-ones matrices as a sum of two Kronecker products, and apply it to design recursive prefix sum algorithms and…

Quantum Physics · Physics 2025-12-24 Aleksandros Sobczyk , Anastasios Zouzias

We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…

Classical Analysis and ODEs · Mathematics 2026-02-20 Paweł J. Szabłowski

In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…

Discrete Mathematics · Computer Science 2015-12-31 Hongyu Wang , Jin Xu , Bing Yao
‹ Prev 1 2 3 10 Next ›