View in EDS

Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations.

Saved in:
Bibliographic Details
Title: Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations.
Authors: Sun, Daoqiang1, Liu, Hongbo1 yangyu@sjtu.edu.cn, Yang, Yu2,3 yangyu@sjtu.edu.cn, Li, Long3, Zhang, Heng2, Fahad, Asfand4,5
Source: Computer Journal. May2024, Vol. 67 Issue 5, p1652-1662. 11p.
Subjects: Combinatorial enumeration problems, Generating functions, Lattice theory, Molecular graphs, Polynomials
Abstract: As a structural topological index, the number of subtrees has great significance for the analysis and design of hybrid locally reliable networks. In this paper, with generating function and introducing a novel two-forest dual transformation technique, we solve the subtree enumerating problems of two representatives of the self-similar networks, such as the hierarchical lattice and |$(u,v)$| -flower networks. Moreover, by means of the circle weight transfer technique, two linear time algorithms of computing the subtree generation functions of these two families of networks are also proposed. The subtree density of two special cases for these self-similar networks is briefly discussed as an application. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 178019535
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sun%2C+Daoqiang%22">Sun, Daoqiang</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Liu%2C+Hongbo%22">Liu, Hongbo</searchLink><relatesTo>1</relatesTo><i> yangyu@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Yang%2C+Yu%22">Yang, Yu</searchLink><relatesTo>2,3</relatesTo><i> yangyu@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Long%22">Li, Long</searchLink><relatesTo>3</relatesTo><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Heng%22">Zhang, Heng</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Fahad%2C+Asfand%22">Fahad, Asfand</searchLink><relatesTo>4,5</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. May2024, Vol. 67 Issue 5, p1652-1662. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Combinatorial+enumeration+problems%22">Combinatorial enumeration problems</searchLink><br /><searchLink fieldCode="DE" term="%22Generating+functions%22">Generating functions</searchLink><br /><searchLink fieldCode="DE" term="%22Lattice+theory%22">Lattice theory</searchLink><br /><searchLink fieldCode="DE" term="%22Molecular+graphs%22">Molecular graphs</searchLink><br /><searchLink fieldCode="DE" term="%22Polynomials%22">Polynomials</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: As a structural topological index, the number of subtrees has great significance for the analysis and design of hybrid locally reliable networks. In this paper, with generating function and introducing a novel two-forest dual transformation technique, we solve the subtree enumerating problems of two representatives of the self-similar networks, such as the hierarchical lattice and |$(u,v)$| -flower networks. Moreover, by means of the circle weight transfer technique, two linear time algorithms of computing the subtree generation functions of these two families of networks are also proposed. The subtree density of two special cases for these self-similar networks is briefly discussed as an application. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=178019535
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/comjnl/bxad090
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 1652
    Subjects:
      – SubjectFull: Combinatorial enumeration problems
        Type: general
      – SubjectFull: Generating functions
        Type: general
      – SubjectFull: Lattice theory
        Type: general
      – SubjectFull: Molecular graphs
        Type: general
      – SubjectFull: Polynomials
        Type: general
    Titles:
      – TitleFull: Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sun, Daoqiang
      – PersonEntity:
          Name:
            NameFull: Liu, Hongbo
      – PersonEntity:
          Name:
            NameFull: Yang, Yu
      – PersonEntity:
          Name:
            NameFull: Li, Long
      – PersonEntity:
          Name:
            NameFull: Zhang, Heng
      – PersonEntity:
          Name:
            NameFull: Fahad, Asfand
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 00104620
          Numbering:
            – Type: volume
              Value: 67
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Computer Journal
              Type: main
ResultId 1