Author:
Xu Liqiong,Lai Hong-Jian,Tian Yingzhi
Funder
National Natural Science Foundation of China
Natural Science Foundation of Fujian Province, China
Digital Fujian Big Data Modeling and Intelligent Computing Institute Open Fund Project
Tianshan Youth Project of Xinjiang
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. A Stude of Arc Strong Connectivity of Digraphs;Anderson,2017
2. Minimax properties of some density measures in graphs and digraphs;Anderson;Int. J. Comput. Math., Syst. Theory,2018
3. On k-maximal strength digraphs;Anderson;J. Graph Theory,2017
4. On the number of edges in a graph with no (k+1)-connected subgraphs;Bernshteyn;Discrete Math.,2016
5. Graph Theory;Bondy,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Counting connected partitions of graphs;Journal of Graph Theory;2024-06-02
2. Subgraph mining in a large graph: A review;WIREs Data Mining and Knowledge Discovery;2022-03-08