Proportional Cram on Crooked Crisscross for N-Hop Systems

  • K. ThiagarajanEmail author
  • M. S. Girija
  • B. R. Tapas Bapu
Conference paper
Part of the Learning and Analytics in Intelligent Systems book series (LAIS, volume 3)


Computer network is converted to a grid and is illustrated with a program dependence graph. Both maximum and minimum level degree based program dependence graph is generated and a proportional study is made on irregular grids. Additionally, graph coloring procedure is also incorporated into it to amplify the recital of the network.


Graph theory N-Hop Network Program dependence graph Shortest trail 



The authors would like to thank Dr. Ponnammal Natarajan, Former Director of Research and Development, Anna University, Chennai, India for her intuitive ideas and fruitful discussions with respect to the paper’s contribution and support to complete this paper.


  1. 1.
    Gallian JA (2016) A dynamic survey of graph labeling. Electron J Comb 18:42–91Google Scholar
  2. 2.
    Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, LondonCrossRefGoogle Scholar
  3. 3.
    Harrary F (1969) Graph theory. Addison Wesley, Reading, MACrossRefGoogle Scholar
  4. 4.
    Chelali M, Volkmann L (2004) Relation between the lower domination parameters and the chromatic number of a graph. Discret Math 274:1–8MathSciNetCrossRefGoogle Scholar
  5. 5.
    Thiagarajan K, Mansoor P (2017) Expansion of network through seminode. IOSRD Int J Netw Sci 1(1):7–11Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • K. Thiagarajan
    • 1
    Email author
  • M. S. Girija
    • 2
  • B. R. Tapas Bapu
    • 3
  1. 1.Academic ResearchJeppiaar Engineering CollegeChennaiIndia
  2. 2.Department of Computer Science and EngineeringJeppiaar Engineering CollegeChennaiIndia
  3. 3.Department of Electronics and Communication EngineeringS.A. Engineering CollegeChennaiIndia

Personalised recommendations