You are here

Home » Content

More on Classes of Strongly Indexable Graphs

Journal Name:

  • European Journal of Pure and Applied Mathematics

Publication Year:

  • 2010

Key Words:

Author NameUniversity of Author

AMS Codes:

Abstract (2. Language): 
Given any positive integer k, a (p, q)-graph G = (V, E) is strongly k-indexable if there exists a bijection f : V → {0,1,2, . . . , p − 1} such that f +(E(G)) = {k, k + 1, k + 2, . . . , k + q − 1, } where f +(uv) = f (u)+ f (v) for any edge uv ∈ E; in particular, G is said to be strongly indexable when k = 1. For any strongly k-indexable (p, q)-graph G, q ≤ 2p − 3 and if, in particular, q = 2p − 3 then G is called a maximal strongly indexable graph. In this paper, our main focus is to construct more classes of k-strongly indexable graphs.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-more-classes-strongly-indexable-graphs.pdf
  • 2
269-281
  • English

REFERENCES

References: 

[1] B.D. Acharya. On the construction of graphs with given constant valence- difference(s) on
each of their lines, Wiss. Z. Th. Ilmenau, 23, 33-60, 1977.
[2] B.D. Acharya and S.M. Hegde. Arithmetic graphs, J. Graph Theory, 14, 275-299, 1990.
[3] B.D. Acharya and Germina K.A. Strongly k-indexable unicyclic graphs, Graph Theory
Notes of New York,45-49, LV:2008.
[4] B.D. Acharya and Germina K.A. Maximal Strongly indexable Graphs, Ars. Combinatorics,
To appear.
[5] J.C. Bermond, A. Kotzig, and J. Turgeon. On a combinatorial problem of antennas in
radio-astronomy. Colloquium of the Mathematical Society, Janos Bolyai 18, Combinatorics,
Hungary, 135-149, 1976.
[6] G.S. Bloom. Numbered undirected graphs and their uses: A survey of unifying scientific
and engineering concepts and its use in developing a theory of non-redundant homometric
sets relating to some ambiguities in x-ray diffraction analysis, Ph. D., dissertation,
Univ. of Southern California, Los Angeles, 1975
[7] A.R. Eckler. The construction of missile guidance codes resistant to random interference,
Bell.Syst. Tech., J, Vol. 39, 973-994, 1960
[8] H. Enomoto. A.S. Llado, T. Nakamigawa, and G. Ringel, Super edge-magic graphs, SUT
J. Math., 34,105-109, 1998.
[9] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle. The place of super-edge-magic
labellings among other classes of labellings, Discrete Math., 231, 153-168, 2001.
[10] J.N. Franklin. ambiguities in the X-ray analysis of crystal structures, Acta Cryst., Vol. A
30, 698-702, Nov. 1974.
[11] F. Harary. Graph Theory, Addison Wesley,Reading, Massachusetts, 1969.
[12] L. H. Harper. DSIF Integrated circuit layout and Iso-perimetric Problems, JPL space program
summary 37-66 Vol. 2, pp. 37-42, sept. 1970
[13] S.M. Hegde and Sudhakar Shetty. Strongly indexable graphs and applications, Discrete
Mathematics, To appear.
[14] J. Leech. on the representation of 1,2, . . . , n by differences, J. London math. Soc., Vol.
31, 160-169, Apr. 1956
[15] J.C. P. Miller, differences basis, three problems in additive number theory, A.D.L. Atkin
and B.J. Birch, Eds, London, Academic Press,299-322, 1971.
[16] G. Ringel. Labeling problems, Proceedings of the Eighth International Conference on Graph
Theory, Combinatorics, Algorithms and Applications. 1996

Thank you for copying data from http://www.arastirmax.com