Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
A graph \(G(V,E)\) is super edge-magic if it has a labeling \(f\) of its vertices and edges using the numbers \(1,2, \ldots , | V| +| E| \) such that \(f(V)= \{ 1, 2, \dots ,| V| \}\) and, for any \(uv \in E\), \(f(u)+ f(v)+f(uv)\) is a constant \(c(f)\). The super edge-magic strength of such a graph is the minimum \(c(f)\) over all super edge-magic labelings \(f\) of \(G\). The authors obtain bounds on the super edge-magic strength for the following graphs \(G\): stars joined by a path, stars joined to a vertex, and graphs with one cycle.
- On super edge-magicness of graphs
- scientific article; zbMATH DE number 1269934
- On super edge-magic graphs
- Super magic strength of a graph
- Super magic strength of a graph
- On Super Edge-Magic Strength and Deficiency of Graphs
- scientific article; zbMATH DE number 6120714
- scientific article; zbMATH DE number 2202191
- On super edge-magic total labeling of banana trees
- Numbers of edges in supermagic graphs
- Bounds of strong EMT strength for certain subdivision of star and bistar
- SEMT valuation and strength of subdivided star of \(K_{1,4}\)
- Values and bounds for depth and Stanley depth of some classes of edge ideals
- Embedding of supplementary results in strong EMT valuations and strength
- Reverse super edge-magic strength of some special trees
- Laplacian spectral characterization of two families of trees
- Enumerating super edge-magic labelings for the union of nonisomorphic graphs
- Super edge-magic strength of some trees
- Neighbourhood V₄-magic labeling of some star and path related graphs
- On Super Edge-Magic Strength and Deficiency of Graphs
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- Super magic strength of a graph
This page was built for publication: Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497529)
