VERTICES

作品数:83被引量:56H指数:5
导出分析报告
相关领域:理学更多>>
相关作者:袁夫永陈明珠欧阳晨周本达陈明华更多>>
相关机构:华南师范大学广西职业技术学院皖西学院南京师范大学更多>>
相关期刊:更多>>
相关基金:国家自然科学基金福建省自然科学基金上海市教育委员会重点学科基金国家重点实验室开放基金更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-10
视图:
排序:
Gallai-Ramsey numbers for three graphs on at most five vertices
《Applied Mathematics(A Journal of Chinese Universities)》2025年第1期137-148,共12页SU Xue-li LIU Yan 
Supported by the National Natural Science Foundation of China(12161073)。
A Gallai k-coloring is a k-edge-coloring of a complete graph in which there are no rainbow triangles.For given graphs G_(1),G_(2),G_(3)and nonnegative integers r,s,t with k=r+s+t,the k-colored Gallai-Ramsey number grk...
关键词:Gallai coloring rainbow triangle monochromatic graph Gallai-Ramsey number 
Reciprocal Distance Laplacian Eigenvalue Distribution Based on Graph Parameters
《新疆大学学报(自然科学版中英文)》2024年第5期562-570,共9页CUI Jiaxin MA Xiaoling 
supported by the Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Graph problems of topological parameters based on the spectra of graph matrices”(2021D01C069);the National Natural Science Foundation of the People's Republic of China“The investigation of spectral properties of graph operations and their related problems”(12161085)。
Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I ...
关键词:reciprocal distance Laplacian eigenvalue VERTEX-CONNECTIVITY independence number pendant vertices 
Nonlinear Relationship and Its Evolutionary Trace between Average Degree and Average Path Length of Edge Vertices of China Aviation Network Based on Complex Network
《Journal of Traffic and Transportation Engineering》2024年第5期224-237,共14页Cheng Xiangjun Chen Xumei Guo Jianyuan 
In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation netwo...
关键词:China aviation network complex network average degree of edge vertices average path length of edge vertices logarithmic relationship evolutionary trace 
Probability Distribution of Arithmetic Average of China Aviation Network Edge Vertices Nearest Neighbor Average Degree Value and Its Evolutionary Trace Based on Complex Network
《Journal of Traffic and Transportation Engineering》2024年第4期163-174,共12页Cheng Xiangjun Yang Fang Xiong Zhihua 
In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average...
关键词:Complex network China aviation network arithmetic average of edge vertices nearest neighbor average degree value linear evolution trace 
Probability Distribution of Ratio of China Aviation Network Edge Vertices Degree and Its Evolutionary Trace Based on Complex Network
《Journal of Traffic and Transportation Engineering》2024年第3期119-129,共11页Cheng Xiangjun Yang Fang Wei Liying 
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were s...
关键词:Complex network China aviation network ratio of edge vertices degree linear probability distribution linear evolution trace. 
Probability Distribution of China Aviation Network Average Degree of Edge Vertices and Its Evolutionary Trace Based on Complex Network
《Journal of Traffic and Transportation Engineering》2024年第2期51-62,共12页Cheng Xiangjun Zhang Chunyue Liang Yanping 
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network w...
关键词:Complex network China aviation network average degree of edge vertices normal distribution linear evolution trace 
Stability and Generalization of Hypergraph Collaborative Networks
《Machine Intelligence Research》2024年第1期184-196,共13页Michael K.Ng Hanrui Wu Andy Yip 
Ng was supported in part by Hong Kong Research Grant Council General Research Fund(GRF),China(Nos.12300218,12300519,117201020,17300021,CRF C1013-21GF,C7004-21GF and Joint NSFC-RGC NHKU76921);Wu is supported by National Natural Science Foundation of China(No.62206111);Young Talent Support Project of Guangzhou Association for Science and Technology,China(No.QT-2023-017);Guangzhou Basic and Applied Basic Research Foundation,China(No.2023A04J1058);Fundamental Research Funds for the Central Universities,China(No.21622326);China Postdoctoral Science Foundation(No.2022M721343).
Graph neural networks have been shown to be very effective in utilizing pairwise relationships across samples.Recently,there have been several successful proposals to generalize graph neural networks to hypergraph neu...
关键词:HYPERGRAPHS VERTICES hyperedges collaborative networks graph convolutional neural networks(CNNs) STABILITY generalization guarantees 
Strong vertices of bottom mesons B and B^(*) and bottomonia Υ,ηb
《Chinese Physics C》2024年第1期17-28,共12页卢杰 于国梁 王志刚 吴彬 
Supported by the National Natural Science Foundation of China(12175068);Natural Science Foundation of Hebei Province,China(A2018502124)。
In this study,the strong coupling constants of vertices BBΥ,BB^(∗)Υ,B^(∗)B^(∗)Υ,BB^(∗)ηb,and B^(∗)B^(∗)ηb are analyzed in the framework of QCD sum rules.All possible off-shell cases and the contributions of vacuu...
关键词:bottom meson strong coupling constants QCD sum rules 
Metric Identification of Vertices in Polygonal Cacti
《Computer Modeling in Engineering & Sciences》2023年第7期883-899,共17页Xiujun Zhang Muhammad Salman Anam Rani Rashna Tanveer Usman Ali Zehui Shao 
The distance between two vertices u and v in a connected graph G is the number of edges lying in a shortest path(geodesic)between them.A vertex x of G performs the metric identification for a pair(u,v)of vertices in G...
关键词:METRIC metric identification metric generator metric dimension cactus graph 
How Does Topology Help Solve the Inscribed Rectangle Problem by Proving that Every Jordan Curve Has 4 Vertices that Form a Rectangle?
《Journal of Applied Mathematics and Physics》2023年第4期859-873,共15页Heidi Hassan 
When we stare into our complex surroundings, we see objects of different shapes and sizes. However, the shape that is always present, regardless of the complexity of the object, is the circle. The circle is arguably t...
关键词:Inscribed Rectangle Problem TOPOLOGY Jordan Curve Mobius Strip 
检索报告 对象比较 聚类工具 使用帮助 返回顶部