More on Classes of Strongly Indexable Graphs

Authors

  • Germina Kizhekekunnel Augustine Reader in Mathematics

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{0,1,2,,p1} such that f+(E(G))={k,k+1,k+2,,k+q1,} where f+(uv)=f(u)+f(v) for any edge uvE; in particular, G is said to be \emph{strongly indexable} when k=1. For any strongly k-indexable (p,q)-graph G, q2p3 and if, in particular, q=2p3 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.

Author Biography

  • Germina Kizhekekunnel Augustine, Reader in Mathematics

    Head, Mathematics Research Centre(Kannur university), Mary Matha Arts & Science CollegeMary Matha Arts & Science College, Mananthavady.

    Reader in Mathematics

Downloads

Published

2010-04-09

Issue

Section

Discrete Mathematics

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