Tree-antimagicness of disconnected graphs
Summary: A simple graph \(G\) admits an \(H\)-covering if every edge in \(E(G)\) belongs to a subgraph of \(G\) isomorphic to \(H\). The graph \(G\) is said to be (\(a\), \(d\))-\(H\)-antimagic if there exists a bijection from the vertex set \(V(G)\) and the edge set \(E(G)\) onto the set of integers \(\left\{1, 2, \ldots, \left|V \left(G\right)\right| + \left|E(G)\right|\right\}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic to \(H\), the sum of labels of all vertices and edges belonging to \(H^\prime\) constitute the arithmetic progression with the initial term \(a\) and the common difference \(d\). \(G\) is said to be a super (\(a\), \(d\))-\(H\)-antimagic if the smallest possible labels appear on the vertices. In this paper, we study super tree-antimagic total labelings of disjoint union of graphs.
- On H-antimagicness of disconnected graphs
- Tree-antimagicness of web graphs and their disjoint union
- Edge-antimagicness for a class of disconnected graphs.
- Note on super antimagicness of disconnected graphs
- scientific article; zbMATH DE number 1926041
- Antimagic orientations of disconnected even regular graphs
- Antimagicness of some families of generalized graphs
- Super edge-antimagic gracefulness of disconnected graphs
- On antimagic directed graphs
- A note on antimagic labelings of trees
- H-supermagic labelings of graphs
- Cycle-magic graphs
- scientific article; zbMATH DE number 6383849 (Why is no real title available?)
- scientific article; zbMATH DE number 2186989 (Why is no real title available?)
- scientific article; zbMATH DE number 3857169 (Why is no real title available?)
- scientific article; zbMATH DE number 5717256 (Why is no real title available?)
- scientific article; zbMATH DE number 1269934 (Why is no real title available?)
- Magic coverings
- Magic Graphs
- Magic Valuations of Finite Graphs
- On (super) edge-magic total labelings of a subdivision of a star S_n
- On H-supermagic labelings for certain shackles and amalgamations of a connected graph
- Super (a, d)-H-antimagic total labelings for shackles of a connected graph H
- The place of super edge-magic labelings among other classes of labelings
- Wheels are cycle-antimagic
- \(H\)-coverings of path-amalgamated ladders and fans
- Two constructions of \(H\)-antimagic graphs
- On H-antimagicness of disconnected graphs
- On H-antimagicness of Cartesian product of graphs
- Super \((a,d)\)-star-antimagic graphs
- Ladders and fan graphs are cycle-antimagic
- scientific article; zbMATH DE number 7593805 (Why is no real title available?)
- Tree-antimagicness of web graphs and their disjoint union
This page was built for publication: Tree-antimagicness of disconnected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665840)
