Skip to main content
SpringerLink
Log in

On Partitional Labelings of Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

The notion of partitional graphs, a subclass of sequential graphs, is introduced, and the cartesian product of a partitional graph and K 2 is shown to be partitional. Every sequential graph is harmonious and felicitous. The partitional property of some bipartite graphs including the n-dimensional cube Q n is studied, and thus this paper extends what was known about the sequentialness, harmoniousness and felicitousness of such graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chartrand, G., Lesniak, L.: Graphs and Digraphs, 2nd edn. Wadsworth & Brooks/Cole Advanced Books and Software, Monterey (1986)

  2. Figueroa-Centeno R.M., Ichishima R., Muntaner-Batle F.A.: The place of super edge-magic labelings among other classes of labelings. Discrete Math. 231, 153–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Figueroa-Centeno R.M., Ichishima R.: The n-dimensional cube is felicitous. Bull. Inst. Comb. Appl. 41, 47–50 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Gallian A.J., Jungreis D.S.: Labeling books. Scientia 1, 53–57 (1988)

    MathSciNet  MATH  Google Scholar 

  5. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 5, #DS6 (2009)

  6. Grace T.: On sequential labelings of graphs. J. Graph Theory 7, 195–201 (1982)

    Article  MathSciNet  Google Scholar 

  7. Graham R.L., Sloane N.J.: On additive bases and harmonious graphs. SIAM J. Algebra Discrete Math. 1, 382–404 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kotzig A.: Decomposition of complete graphs into isomorphic cubes. J. Comb. Theory Ser. B. 31, 292–296 (1981)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Humanities and Sciences, Nihon University, 3-25-40 Sakurajyousui, Setagaya-ku, Tokyo, 156-8550, Japan

    Rikio Ichishima

  2. Department of Mathematical Information Science, Tokyo University of Science, 1-3 Shinjuku-ku, Tokyo, 162-8601, Japan

    Akito Oshima

Authors
  1. Rikio Ichishima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akito Oshima
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rikio Ichishima.

Additional information

Dedicated to our friend and colleague Yasuhiro Fukuchi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ichishima, R., Oshima, A. On Partitional Labelings of Graphs. Math.Comput.Sci. 3, 39–45 (2010). https://doi.org/10.1007/s11786-009-0008-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-009-0008-7

Keywords

Mathematics Subject Classification (2000)

Search

Navigation