The power of digraph products applied to labelings
From MaRDI portal
Publication:658044
DOI10.1016/J.DISC.2011.08.025zbMath1233.05111OpenAlexW1978706489MaRDI QIDQ658044
Rikio Ichishima, M. Rius-Font, Susana-Clara López, Francesc Antoni Muntaner-Batle
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.025
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (11)
Connectivity and other invariants of generalized products of graphs ⋮ A new labeling construction from the \(\otimes_h\)-product ⋮ A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings ⋮ Perfect (super) edge-magic crowns ⋮ (Di)graph products, labelings and related results ⋮ Langford sequences and a product of digraphs ⋮ Labeling constructions using digraph products ⋮ The jumping knight and other (super) edge-magic constructions ⋮ On $H$-antimagicness of Cartesian product of graphs ⋮ (Di)graph decompositions and magic type labelings: a dual relation ⋮ New constructions for the \(n\)-queens problem
Cites Work
- On partitional labelings of graphs
- On partitional and other related graphs
- On super \((a,1)\)-edge-antimagic total labelings of regular graphs
- A conjecture on strong magic labelings of 2-regular graphs
- On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs
- Vertex-magic labelings of regular graphs. II.
- Strongly indexable graphs
- A dynamic survey of graph labeling
- Strong labelings of linear forests
- BI-MAGIC AND OTHER GENERALIZATIONS OF SUPER EDGE-MAGIC LABELINGS
- ENUMERATING SUPER EDGE-MAGIC LABELINGS FOR THE UNION OF NONISOMORPHIC GRAPHS
- On sequential labelings of graphs
- On Additive Bases and Harmonious Graphs
- Vertex‐Magic Total Labelings of Regular Graphs
- Magic Valuations of Finite Graphs
- The place of super edge-magic labelings among other classes of labelings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The power of digraph products applied to labelings