ON THE EDGE RECONSTRUCTION OF SIX DIGRAPH POLYNOMIALS

被引：0
|
作者：
Zhang, Jingyuan [1 ]
Jin, Xian'an [1 ]
Yan, Weigen [1 ]
机构：
[1] School of Mathematical Science, Xiamen University, Xiamen,361001, China
来源：
arXiv | 2023年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ON DIGRAPH RECONSTRUCTION
    RAMACHANDRAN, S
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 1989, 20 (08): : 782 - 785
  • [2] Adjacency polynomials of digraph transformations
    Deng, Aiping
    Feng, Mengyu
    Kelmans, Alexander
    DISCRETE APPLIED MATHEMATICS, 2016, 206 : 15 - 38
  • [3] On the edge reconstruction of the characteristic and permanental polynomials of a simple graph
    Zhang, Jingyuan
    Jin, Xian'an
    Yan, Weigen
    Liu, Qinghai
    DISCRETE MATHEMATICS, 2024, 347 (09)
  • [4] ON A NEW DIGRAPH RECONSTRUCTION CONJECTURE
    RAMACHANDRAN, S
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (02) : 143 - 149
  • [5] Classes of Digraph Structures Corresponding to Characteristic Polynomials
    Hryniow, Krzysztof
    Markowski, Konrad Andrzej
    CHALLENGES IN AUTOMATION, ROBOTICS AND MEASUREMENT TECHNIQUES, 2016, 440 : 329 - 339
  • [6] ALGORITHM FOR THE OPTIMAL RECONSTRUCTION OF A DIGRAPH
    MALYSHKO, VV
    YANCHENKO, SS
    CYBERNETICS, 1981, 17 (01): : 63 - 66
  • [7] On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph
    Ganie, Hilal A. A.
    Shang, Yilun
    SYMMETRY-BASEL, 2023, 15 (01):
  • [8] NEW COUNTEREXAMPLES TO DIGRAPH RECONSTRUCTION CONJECTURE
    STOCKMEYER, PK
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (07): : A654 - A655
  • [9] Incrementing Bipartite Digraph Edge-Connectivity
    Harold N. Gabow
    Tibor Jordán
    Journal of Combinatorial Optimization, 2000, 4 : 449 - 486
  • [10] Incrementing bipartite digraph edge-connectivity
    Gabow, HN
    Jordán, T
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (04) : 449 - 486
12345