云南高校图书馆联盟文献共享服务平台- DIGRAPHS

DIGRAPHS: 作品数：66被引量：67H指数：5; 导出分析报告; 相关作者：柳柏濂李育强张福基姚伯华林国宁更多>>; 相关机构：华南师范大学山东师范大学新疆大学厦门大学更多>>; 相关期刊：《Wuhan University Journal of Natural Sciences》《Journal of Donghua University(English Edition)》《Journal of Applied Mathematics and Physics》《Control Theory and Technology》更多>>; 相关基金：国家自然科学基金上海市教育委员会重点学科基金山西省自然科学基金广东省自然科学基金更多>>

Distributed algorithm for solving variational inequalities over time-varying unbalanced digraphs: 《Control Theory and Technology》2024年第3期431-441,共11页Yichen Zhang Yutao Tang Zhipeng Tu Yiguang Hong; supported by the National Natural Science Foundation of China(No.61973043);Shanghai Municipal Science and Technology Major Project(No.2021SHZDZX0100).; In this paper,we study a distributed model to cooperatively compute variational inequalities over time-varying directed graphs.Here,each agent has access to a part of the full mapping and holds a local view of the glo...; 关键词：Variational inequality Distributed computation Multi-agent system Weight-unbalanced graph

On an Invariant of Tournament Digraphs: 《Journal of Applied Mathematics and Physics》2024年第7期2711-2722,共12页Boris F. Melnikov Bowen Liu; To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successf...; 关键词：GRAPH Directed Graph TOURNAMENT ?nvariant

Restricted Arc-Connectivity of Harary Digraphs: 《Journal of the Operations Research Society of China》2024年第2期540-547,共8页Jun-Hao Zhang Ji-Xiang Meng; the National Natural Science Foundation of China(No.11531011).; The h-restricted arc-connectivity of a digraph is an important parameter to measure fault-tolerance of interconnection networks.This paper determines that the h-restricted arc-connectivity of the Harary digraph D=G(n;...; 关键词：Restricted arc-connectivity λ_(h)(D) Super-λ_(h) λ_(h)-Atom λ_(h)-Superatom

Output-based adaptive distributed observer for general linear leader systems over periodic switching digraphs: 《Autonomous Intelligent Systems》2023年第1期123-130,共8页Changran He Jie Huang; the Research Grants Council of the Hong Kong Special Administrative Region under Grant Nos.14202619 and PDFS2223-4S02;the National Natural Science Foundation(NSFC)of China under Grant No 61973260.; In this paper,we present a sufficient condition for the exponential stability of a class of linear switched systems.As an application of this stability result,we establish an output-based adaptive distributed observer...; 关键词：Distributed observer Multi-agent systems Stability Switched systems

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

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

Biggs Theorem for Directed Cycles and Topological Invariants of Digraphs: 《Advances in Pure Mathematics》2021年第6期573-594,共22页Michael Hecht Ivo F. Sbalzarini; We generalize Biggs Theorem to the case of directed cycles of multi-digraphs allowing to compute the dimension of the directed cycle space independently of the graph representation with linear runtime complexity. By c...; 关键词：Biggs Theorem Elementary and Simple Cycles CW Complexes of Graphs Cellular and Singular Homology Betti Numbers

On Algebraic Group Proper ties of Strong Product of Digraphs: 《Chinese Quarterly Journal of Mathematics》2020年第4期424-430,共7页YIN Hao-ran LI Feng; Supported by National Natural Science Foundation of China(Grant No. 11551002);Natural Science Foundation of Qinghai Province (Grant No. 2019-ZJ-7093)。; The strong product digraph G1■G2 is constructed by the known digraph G1 and G2 of small order. The digraph G1■G2 constructed by the strong product method contain G1 and G2 as its sub-graphs. Therefore, the topologic...; 关键词：Strong product DIGRAPHS Commutative law Associative law

Dynamic aspects of domination networks: 《Frontiers of Information Technology & Electronic Engineering》2020年第4期635-648,共14页Yu-xian LIU Ronald ROUSSEAU; Project supported by the National Social Sciences Fund(No.17AKS004);the National Natural Science Foundation of China(Nos.71173154 and 71810107004)。; A dynamic quantitative theory and measurement of power or dominance structures are proposed.Such power structures are represented as directed networks.A graph somewhat similar to the Lorenz curve for inequality measur...; 关键词：DOMINATION Power structure DIGRAPHS NETWORK DYNAMICS

DIGRAPHS