English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The super edge-magicness of graphs of equal order and size has been shown tobe important since such graphs can be used as seeds to answer many questionsrelated to (super) edge-magic labelings and other types of well studiedlabelings, as for instance harmonious labelings. Also other questions relatedto the area of combinatorics can be attacked and understood from the point ofview of super edge-magic graphs of equal order and size. For instance, thedesign of Steiner triple systems, the study of the set of dual shuffle primesand the Jacobsthal numbers. In this paper, we study the super edge-magicproperties of some types of super edge-magic graphs of equal order and size,with the hope that they can be used later in the study of other relatedquestions. The negative results found in last section are specially interestingsince these kind of results are not common in the literature. Furthermore, thefew results found in this direction usually meet one of the following reasons:too many vertices compared with the number of edges; too many edges comparedwith the number of vertices; or parity conditions. In this case, all previousreasons fail in our results.

On the super edge-magicness of graphs of equal order and size