# More on Classes of Strongly Indexable Graphs

## Keywords:

Strongly Indexable, Edge-magic, Super-edge-magic, Graphs## Abstract

Given any positive integer $k$, a $(p,q)$-graph $G = (V, E)$ is \emph{strongly $k$-indexable} if there exists a bijection $f:V \rightarrow \{0, 1, 2, \dots, p-1\}$ such that $f^+(E(G)) = \{k, k+1, k+2, \dots, k+q-1,\}$ where $f^+(uv) = f(u) + f(v)$ for any edge $uv \in E$; in particular, $G$ is said to be \emph{strongly indexable} when $k = 1$. For any strongly $k$-indexable $(p,q)$-graph $G, \ q \le 2p-3$ and if, in particular, $q = 2p-3$ then $G$ is called a \emph{maximal strongly indexable graph}. In this paper,Â our main focus is to construct more classes ofÂ $k$-strongly indexable graphs.## Downloads

## Published

2010-04-09

## How to Cite

*European Journal of Pure and Applied Mathematics*,

*3*(2), 269–281. Retrieved from https://ejpam.com/index.php/ejpam/article/view/577

## Issue

## Section

Discrete Mathematics

## License

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to *European Journal of Pure and Applied Mathematics.*

*European Journal of Pure and Applied Mathematics will be Copyright Holder.*