Skip to main content

2019 | OriginalPaper | Buchkapitel

Wiener Index of Hypertree

verfasst von : L. Nirmala Rani, K. Jennifer Rajkumari, S. Roy

Erschienen in: Applied Mathematics and Scientific Computing

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Binary trees are enormously used in data structure as they can be easily stored, manipulated, and retrieved. The most straightforward and extensive applications of binary trees are in the study of computer searching and sorting methods, binary identification problems, and variable binary codes. Many complex networks are easily classified and analyzed by the usage of binary tree representations. A binary tree is defined as a tree in which there is exactly one vertex of degree two and each of the remaining vertices is of degree one or three. Every binary tree is a rooted tree with odd number of vertices. A special type of binary tree known as hypertree is an interconnection topology which combines the easy expansibility of tree structures with the compactness of the hypercube. In this paper we find the Wiener index of hypertree.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Saad, Y., Schultz, M. H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867–872 (1988).CrossRef Saad, Y., Schultz, M. H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867–872 (1988).CrossRef
2.
Zurück zum Zitat Ivanciuc, O., Ivanciuc, T., Balaban, A. T.: Design of topological indices. Part 10. Parameters based on electronegativity and covalent radius for the computation of molecular graph descriptors for heteroatom-containing molecules. J. Chem. Inf. Comput. Sci. 38, 395–401 (1998)CrossRef Ivanciuc, O., Ivanciuc, T., Balaban, A. T.: Design of topological indices. Part 10. Parameters based on electronegativity and covalent radius for the computation of molecular graph descriptors for heteroatom-containing molecules. J. Chem. Inf. Comput. Sci. 38, 395–401 (1998)CrossRef
3.
Zurück zum Zitat Luiu, B., Nikoli, S., Trinajsti, N.: Distance-Related Molecular Descriptors. Internet Electronic Journal of Molecular Design. 7, 195–206 (2008). Luiu, B., Nikoli, S., Trinajsti, N.: Distance-Related Molecular Descriptors. Internet Electronic Journal of Molecular Design. 7, 195–206 (2008).
4.
Zurück zum Zitat Balaban, A. T.: Topological indices based on topological distances in molecular graphs. Pure Appl. Chem. 55, 199–206 (1983).CrossRef Balaban, A. T.: Topological indices based on topological distances in molecular graphs. Pure Appl. Chem. 55, 199–206 (1983).CrossRef
5.
Zurück zum Zitat Wiener, M.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69, 17–20 (1947).CrossRef Wiener, M.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69, 17–20 (1947).CrossRef
6.
Zurück zum Zitat Gutman, I., Yeh, Y. N., Lee, S. L., Luo,Y. L.: Some recent results in the theory of the Wiener number. Indian J. Chem. 32A, 651–661 (1993). Gutman, I., Yeh, Y. N., Lee, S. L., Luo,Y. L.: Some recent results in the theory of the Wiener number. Indian J. Chem. 32A, 651–661 (1993).
9.
Zurück zum Zitat Dobrynin, A. A., Entringer, R., Gutman, I.: Wiener index of trees: theory and applications. Acta Appl. Math. 66, 211–249 (2011).MathSciNetCrossRef Dobrynin, A. A., Entringer, R., Gutman, I.: Wiener index of trees: theory and applications. Acta Appl. Math. 66, 211–249 (2011).MathSciNetCrossRef
10.
Zurück zum Zitat Randi, M.: On generalization of Wiener index for cyclic structures. Acta Chim. Slov. 49, 483–496 (2002). Randi, M.: On generalization of Wiener index for cyclic structures. Acta Chim. Slov. 49, 483–496 (2002).
11.
Zurück zum Zitat Khadikar, P. V., Deshpande, N. V., Kale, P. P., Dobrynin, A. A., Gutman, I., DĆmĆtor, G.: The Szeged index and an analogy with the Wiener index. J. Chem. Inf. Comput. Sci. 35, 547–550 (1995).CrossRef Khadikar, P. V., Deshpande, N. V., Kale, P. P., Dobrynin, A. A., Gutman, I., DĆmĆtor, G.: The Szeged index and an analogy with the Wiener index. J. Chem. Inf. Comput. Sci. 35, 547–550 (1995).CrossRef
12.
13.
Zurück zum Zitat Zhang, X. D., Xiang, Q.-Y., Xu, L.-Q., Pan, R.-Y. The Wiener index of trees with given degree sequences. Math. Comput. Chem. 60, 623–644 (2008).MathSciNetMATH Zhang, X. D., Xiang, Q.-Y., Xu, L.-Q., Pan, R.-Y. The Wiener index of trees with given degree sequences. Math. Comput. Chem. 60, 623–644 (2008).MathSciNetMATH
14.
Zurück zum Zitat Opatrn, J., Sotteau, D.: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discrete Appl. Math. 98, 237–254 (2000).MathSciNetCrossRef Opatrn, J., Sotteau, D.: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discrete Appl. Math. 98, 237–254 (2000).MathSciNetCrossRef
15.
Zurück zum Zitat Rajasingh, I., Quadras, J., Manuel, P., William, A.: Embedding of cycles and wheels into arbitrary trees. Networks. 44(3),173–178 (2004).MathSciNetCrossRef Rajasingh, I., Quadras, J., Manuel, P., William, A.: Embedding of cycles and wheels into arbitrary trees. Networks. 44(3),173–178 (2004).MathSciNetCrossRef
16.
Zurück zum Zitat Lim, H-S., Park, J-H., Chwa, K-Y.: Embedding trees in recursive circulants, Discrete applied Mathematics, 69(1–2),83–89 (1996).MathSciNetCrossRef Lim, H-S., Park, J-H., Chwa, K-Y.: Embedding trees in recursive circulants, Discrete applied Mathematics, 69(1–2),83–89 (1996).MathSciNetCrossRef
17.
Zurück zum Zitat Rajasingh, I., Manuel, P., Rajan, B., Arockiaraj, M.: Wirelength of hypercubes into certain trees. Discrete Applied Mathematics. 1601(18), 2778–2786 (2012).MathSciNetCrossRef Rajasingh, I., Manuel, P., Rajan, B., Arockiaraj, M.: Wirelength of hypercubes into certain trees. Discrete Applied Mathematics. 1601(18), 2778–2786 (2012).MathSciNetCrossRef
18.
Zurück zum Zitat Goodman, J.R., Sequin, C.H.: A multiprocessor interconnection topology. IEEE Transactions on Computers. 30(12), 923–933 (1981).CrossRef Goodman, J.R., Sequin, C.H.: A multiprocessor interconnection topology. IEEE Transactions on Computers. 30(12), 923–933 (1981).CrossRef
19.
Zurück zum Zitat Papa, D. A., Markov, I. L.: Hypergraph Partitioning and Clustering: In Approximation Algorithms and Metaheuristics. CRC Press, (2007). Papa, D. A., Markov, I. L.: Hypergraph Partitioning and Clustering: In Approximation Algorithms and Metaheuristics. CRC Press, (2007).
20.
Zurück zum Zitat Heuvel, J. V. D., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs. Networks, 51(2), 113–119 (2008).MathSciNetCrossRef Heuvel, J. V. D., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs. Networks, 51(2), 113–119 (2008).MathSciNetCrossRef
21.
Zurück zum Zitat Akram, M., Dudek, W. A.: Intuitionistic fuzzy hypergraphs with applications. Information Sciences. 218, 182–193 (2013).MathSciNetCrossRef Akram, M., Dudek, W. A.: Intuitionistic fuzzy hypergraphs with applications. Information Sciences. 218, 182–193 (2013).MathSciNetCrossRef
22.
Zurück zum Zitat Brandstadt, A., Chepoi, V. D., Dragan, F. F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings, Discrete Applied Mathematics. 82, 43–77 (1998).MathSciNetCrossRef Brandstadt, A., Chepoi, V. D., Dragan, F. F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings, Discrete Applied Mathematics. 82, 43–77 (1998).MathSciNetCrossRef
23.
Zurück zum Zitat Sundara Rajan, R., Jeyagopal, R., Rajasingh, I., Rajalaxmi, T. M., Parthiban, N.: Combinatorial properties of Root-fault hypertree. Procedia Computer Science. 57, 1096–1103 (2015).CrossRef Sundara Rajan, R., Jeyagopal, R., Rajasingh, I., Rajalaxmi, T. M., Parthiban, N.: Combinatorial properties of Root-fault hypertree. Procedia Computer Science. 57, 1096–1103 (2015).CrossRef
24.
Zurück zum Zitat Manuel, P., Rajasingh, I., Rajan, B., Sundara Rajan, R.: A New Approach to Compute Wiener Index. Journal of Computational and Theoretical Nanoscience. 10, 1–7 (2013).CrossRef Manuel, P., Rajasingh, I., Rajan, B., Sundara Rajan, R.: A New Approach to Compute Wiener Index. Journal of Computational and Theoretical Nanoscience. 10, 1–7 (2013).CrossRef
Metadaten
Titel
Wiener Index of Hypertree
verfasst von
L. Nirmala Rani
K. Jennifer Rajkumari
S. Roy
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-01123-9_49