DIGRAPH

作品数:86被引量:100H指数:5
导出分析报告
相关作者:高玉斌邵燕灵郭红文王承德童心更多>>
相关机构:北京理工大学华北工学院西北工业大学武汉大学更多>>
相关期刊:更多>>
相关基金:国家自然科学基金上海市教育委员会重点学科基金中国博士后科学基金福建省自然科学基金更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-10
视图:
排序:
Some New Results on Majority Coloring of Digraphs
《Acta Mathematicae Applicatae Sinica》2025年第2期337-343,共7页Jian-sheng CAI Wei-hao XIA Gui-ying YAN 
supported by the National Natural Science Foundation of China(No.12071351,11571258).
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors.Kreutzer et al.conjectured that every digraph is majority 3-colorable.For an i...
关键词:majority coloring 1/k-majority coloring DIGRAPH random digraph 
非正则赋权有向图A_(α)谱半径的上界
《Chinese Quarterly Journal of Mathematics》2024年第2期161-170,共10页席维鸽 许涛 
Supported by the National Natural Science Foundation of China (Grant No.12001434);The Natural Science Basic Research Program of Shaanxi Province (Grant No.2022JM-006);Chinese Universities Scientific Fund (Grant No.2452020021)
Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix...
关键词:Strongly connected Irregular weighted digraph A_(α)spectral radius Upper bounds 
Flexible path planning-based reconfiguration strategy for maximum capacity utilization of battery pack
《Journal of Energy Chemistry》2023年第11期362-372,I0008,共12页Xinghua Liu Guoyi Chang Jiaqiang Tian Zhongbao Wei Xu Zhang Peng Wang 
supported in part by the National Natural Science Foundation of China(62203352,U2003110);in part by the Key Laboratory Project of Shaanxi Provincial Department of Education(20JS110);in part by the Thousand Talents Plan of Shaanxi Province for Young Professionals。
Maximizing the utilization of lithium-ion battery capacity is an important means to alleviate the range anxiety of electric vehicles.Battery pack inconsistency is the main limiting factor for improving battery pack ca...
关键词:Lithium-ion battery Capacity maximum utilization Reconfigurable topology DIGRAPH 
有向图的加权解析挠率
《Chinese Quarterly Journal of Mathematics》2023年第1期30-49,共20页任世全 王冲 
REN Shi-quan is supported by China Postdoctoral Science Foundation(Grant No.2022M721023);WANG Chong is supported by Science and Technology Project of Hebei Education Department(Grant No.ZD2022168);Project of Cangzhou Normal University(Grant No.XNJJLYB2021006).
In 2020,Alexander Grigor'yan,Yong Lin and Shing-Tung Yau[6]introduced the Reidemeister torsion and the analytic torsion for digraphs by means of the path complex and the path homology theory.Based on the analytic tors...
关键词:Chain complex Hodge-Laplace operator Analytic torsion HOMOLOGY DIGRAPH Weighted simplicial complex 
Spanning Eulerian Subdigraphs in Jump Digraphs
《Journal of Mathematical Research with Applications》2022年第5期441-454,共14页Juan LIU Hong YANG Hongjian LAI Xindong ZHANG 
Supported by the National Natural Science Foundation of China(Grant Nos.11761071,11861068);Guizhou Key Laboratory of Big Data Statistical Analysis,China(Grant No.[2019]5103);the Natural Science Foundation of Xinjiang Uygur Autonomous Region(Grant No.2022D01E13)。
A jump digraph J(D)of a directed multigraph D has as its vertex set being A(D),the set of arcs of D;where(a,b)is an arc of J(D)if and only if there are vertices u1,v1,u2,v2in D such that a=(u1,v1),b=(u2,v2)and v1≠u2....
关键词:supereulerian digraph line digraph jump digraph weakly trail-connected strongly trail-connected 
Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices
《Journal of Systems Science & Complexity》2022年第5期1808-1823,共16页FAN Naqi ZHANG Lijun ZHANG Shenggui LIU Jiuqiang 
supported by the National Natural Science Foundation of China under Grant Nos.61573288,12071370,U1803263,71973103;Key Programs in Shaanxi Province of China under Grant No.2021JZ-12。
In 2011,Liu,et al.investigated the structural controllability of directed networks.They proved that the minimum number of input signals,driver nodes,can be determined by seeking a maximum matching in the directed netw...
关键词:DIGRAPH directed network maximum matching semi-tensor product of matrices structural controllability 
3-Anti-Circulant Digraphs Are α-Diperfect and BE-Diperfect
《Open Journal of Discrete Mathematics》2022年第3期29-46,共18页Lucas I. B. Freitas Orlando Lee 
Let D be a digraph. A subset S of V (D) is a stable set if every pair of vertices in S is non-adjacent in D. A collection of disjoint paths is a path partition of D, if every vertex in V (D) is in exactly one path of ...
关键词:3-Anti-Circulant Digraph Diperfect Digraph Berge’s Conjecture Begin-End Conjecture 
Discrete Morse Theory on Join of Digraphs
《Wuhan University Journal of Natural Sciences》2022年第4期303-312,共10页WANG Chong ZHAO Suqian CUI Shuwen 
Supported by Science and Technology Project of Hebei Education Department(ZD2022168);Project of Cangzhou Normal University(XNJJLYB2021006);Science and Technology Project of Hebei Education Department(ZD2020410)
For given two digraphs,we can construct a larger digraph through join.The two digraphs that make up the join are called the factors of the join.In this paper,we give a necessary and sufficient condition that the funct...
关键词:path homology transitive closure DIGRAPH JOIN 
Discussions on Orthogonal Factorizations in Digraphs
《Acta Mathematicae Applicatae Sinica》2022年第2期417-425,共9页Si-zhong ZHOU Hong-xia LIU 
Let m,t,r and k_(i)(1≤i≤m)be positive integers with k_(i)≥(t+3)r/2,and G be a digraph with vertex set V(G)and arc set E(G).Let H_(1),H_(2),…,H_(t) be t vertex-disjoint subdigraphs of G with mr arcs.In this article...
关键词:NETWORK DIGRAPH FACTOR FACTORIZATION orthogonal factorization 
Majority Coloring of r-Regular Digraph
《Chinese Quarterly Journal of Mathematics》2022年第2期142-146,共5页XIA Wei-hao SHI Mei XIAO Ming-yue CAI Jian-sheng WANG Ji-hui 
Supported by the National Natural Science Foundation of China(Grant No.12071351);the Natural Science Foundation of Shandong Provence(Grant No.ZR2020MA043).
A majority k-coloring of a digraph D with k colors is an assignment c:V(D)→{1,2,…,k},such that for every v∈V(D),we have c(w)=c(v)for at most half of all out-neighbors w∈N^(+)(v).For a natural number k≥2,a 1/k-maj...
关键词:Majority coloring Regular digraph 1/k-Majority coloring 
检索报告 对象比较 聚类工具 使用帮助 返回顶部