Skip to main content
SpringerLink
Log in

Characterizations of H-graphs

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9602))

Included in the following conference series:

  • 1167 Accesses

Abstract

The purpose of this paper is to introduce the new family of H-graphs that generalizes the existing notions of trees, higher dimensional trees and k-ctrees. Further, we establish the characterizations of both the wheel-graphs \(G\langle W_n \rangle \) for \(n \ge 6\) and \(T_k\)-graphs for \(k \ge 4\), where \(T_k\) is not a star. Finally, we determine the conditions under which the \(T_k\)-graphs are split graphs and also propose some open problems for further research.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arnborc, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Math. 7(2), 305–314 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beineke, L.W., Pippert, R.E.: Properties and characterizations of k-trees. Mathematica 18, 141–151 (1971)

    MathSciNet  MATH  Google Scholar 

  3. Dewdney, A.K.: Higher-dimensional tree structures. J. Comb. Theory (B) 17, 160–169 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  4. Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Academic press, New York (1980)

    MATH  Google Scholar 

  5. Harary, F.: Graph Theory. Addision-Wesley, Reading (1969)

    MATH  Google Scholar 

  6. Patil, H.P.: On the structure of \(k\)-trees. J. Comb. Inform. Syst. Sci. 11(2–4), 57–64 (1986)

    MathSciNet  MATH  Google Scholar 

  7. Patil, H.P., Pandiya Raj, R.: Characterizations of k-ctrees and graph valued functions. JCMCC 84, 91–98 (2013)

    MathSciNet  MATH  Google Scholar 

  8. Patil, H.P., Raja, V.: \(H\)-trees involving line graphs and split graphs (Preprint)

    Google Scholar 

Download references

Acknowledgments

The authors are thankful to the Referees for their many valuable suggestions and helpful comments, to improve our paper. The first author-Research supported by UGC-SAP DRS-II (2015) and the second author- Research supported by UGC-BSR-SRF, Research Fellowship, Government of India, New Delhi, India.

Author information

Authors and Affiliations

  1. Department of Mathematics, Pondicherry University, Puducherry, 605014, India

    H. P. Patil & V. Raja

Authors
  1. H. P. Patil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Raja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. P. Patil .

Editor information

Editors and Affiliations

  1. Indian Institute of Science, Bangalore, India

    Sathish Govindarajan

  2. Carleton University, Ottawa, ON, Canada

    Anil Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Patil, H.P., Raja, V. (2016). Characterizations of H-graphs. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29221-2_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29220-5

  • Online ISBN: 978-3-319-29221-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation