Yu Yang

Orcid: 0000-0002-0604-048X

Affiliations:
  • Shanghai Jiao Tong University, School of Mathematical Sciences, Shanghai, China
  • Pingdingshan University, School of Software, Pingdingshan, China
  • Henan University of Technology, College of Information Science and Engineering, ZhengZhou, China
  • Dalian Maritime University, School of Information, Dalian, China (PhD 2016)


According to our database1, Yu Yang authored at least 27 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The subpath number of cactus graphs.
Comput. Appl. Math., April, 2026

Invitation to the subpath number.
Appl. Math. Comput., 2026

2025
Exact counting of subtrees with diameter no more than d in trees: A generating function approach.
Inf. Comput., 2025

2024
Algorithms for enumerating multiple leaf-distance granular regular <i>α</i>-subtree of unicyclic and edge-disjoint bicyclic graphs.
Appl. Math. Comput., February, 2024

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

2023
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices.
Discret. Appl. Math., November, 2023

Enumerating Subtrees of Flower and Sunflower Networks.
Symmetry, February, 2023

2022
On enumerating algorithms of novel multiple leaf-distance granular regular <i>α</i>-subtrees of trees.
Inf. Comput., 2022

Algorithms Based on Path Contraction Carrying Weights for Enumerating Subtrees of Tricyclic Graphs.
Comput. J., 2022

Enumeration of subtrees of planar two-tree networks.
Appl. Math. Comput., 2022

2021
Novel Fast Networking Approaches Mining Underlying Structures From Investment Big Data.
IEEE Trans. Syst. Man Cybern. Syst., 2021

Self-Adaptive Skeleton Approaches to Detect Self-Organized Coalitions From Brain Functional Networks Through Probabilistic Mixture Models.
ACM Trans. Knowl. Discov. Data, 2021

Enumeration of subtrees and BC-subtrees with maximum degree no more than <i>k</i> in trees.
Theor. Comput. Sci., 2021

2020
The expected subtree number index in random polyphenylene and spiro chains.
Discret. Appl. Math., 2020

2019
A novel fuzzy rule extraction approach using Gaussian kernel-based granular computing.
Knowl. Inf. Syst., 2019

A Clustering Approach for Motif Discovery in ChIP-Seq Dataset.
Entropy, 2019

Multi-distance granularity structural <i>α</i>-subtree index of generalized Bethe trees.
Appl. Math. Comput., 2019

2018
Substructural Regularization With Data-Sensitive Granularity for Sequence Transfer Learning.
IEEE Trans. Neural Networks Learn. Syst., 2018

2017
On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees.
Int. J. Comput. Math., 2017

On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains.
Comput. J., 2017

2016
Maximum atom-bond connectivity index with given graph parameters.
Discret. Appl. Math., 2016

On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs.
Discret. Appl. Math., 2016

Corrigendum to "Subtrees of spiro and polyphenyl hexagonal chains" [Applied Mathematics and Computation 268(2015) 547-560].
Appl. Math. Comput., 2016

2015
Enumeration of BC-subtrees of trees.
Theor. Comput. Sci., 2015

Subtrees, BC-subtrees of generalized Bethe trees and related questions.
Ars Comb., 2015

Subtrees of spiro and polyphenyl hexagonal chains.
Appl. Math. Comput., 2015

2013
On BC-trees and BC-subtrees
CoRR, 2013


  Loading...