A class of antimagic join graphs
From MaRDI portal
Publication:1949669
Recommendations
Cites work
- A new class of antimagic Cartesian product graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Benjamin Franklin's Numbers
- Dense graphs are antimagic
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- Regular bipartite graphs are antimagic
- Vertex-magic labelings of regular graphs. II.
Cited in
(21)- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Antimagic labelings of join graphs
- Antimagic labeling for unions of graphs with many three-paths
- A new class of antimagic join graphs
- scientific article; zbMATH DE number 6374002 (Why is no real title available?)
- Dense graphs are antimagic
- A class of pairwise-independent joinings
- scientific article; zbMATH DE number 6849636 (Why is no real title available?)
- On the Hartsfield-Ringel hypothesis: connected unigraphs
- On magic joins of graphs
- scientific article; zbMATH DE number 6149573 (Why is no real title available?)
- Antimagic properties of graphs with large maximum degree
- scientific article; zbMATH DE number 7593805 (Why is no real title available?)
- The Cartesian product of wheel graph and path graph is antimagic
- Graph antimagic labeling: a survey
- Construction for antimagic generalized web graphs
- Every graph is homeomorphic to an antimagic bipartite graph
- The direct product of a star and a path is antimagic
- Antimagic labeling and canonical decomposition of graphs
This page was built for publication: A class of antimagic join graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949669)