A graph is said to be total edge bimagic with two common edge counts and if there exists a bijection such that for each edge , or .
A total edge-bimagic graph is called super edge-bimagic if . In this paper, we define new types of super edge-bimagic labeling and prove some interesting results related to super edge-bimagic labeling. Also, its relationship with cordial labeling is studied.