More on Classes of Strongly Indexable Graphs
Keywords:
Strongly Indexable, Edge-magic, Super-edge-magic, GraphsAbstract
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
Issue
Section
Discrete Mathematics
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
How to Cite
More on Classes of Strongly Indexable Graphs. (2010). European Journal of Pure and Applied Mathematics, 3(2), 269-281. https://www.ejpam.com/index.php/ejpam/article/view/577