Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains-Reference-Cited by-同舟云学术

Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains

Published:2022-06-13 Issue:6 Volume:14 Page:1221
ISSN:2073-8994
Container-title:Symmetry
language:en
Short-container-title:Symmetry

Author:

Lei Wanpeng^ORCID,Xiong Liming^ORCID,Du Junfeng,Yin Jun

Abstract

Each traceable graph must be a block-chain; however, a block-chain is not necessarily traceable in general. Whether a given graph is a block-chain or not can be easily verified by a polynomial algorithm. It occurs to us that forbidden subgraph conditions for a block-chain are traceable. In this article, we characterize all pairs of disconnected forbidden subgraphs for the traceability of block-chains, so as to completely solve pairs of forbidden subgraphs for the traceability of block-chains (including disconnected and connected).

Funder

Natural Science Funds of China

Publisher

MDPI AG

Subject

Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2073-8994/14/6/1221/pdf

Reference18 articles.

1. Graph Theory with Applications;Bondy,2008

2. Forbidden Subgraph and Minimum Degree Conditions for Hamiltonicity;Bedrossian;Ph.D. Thesis,1991

3. Forbidden pairs for k-connected Hamiltonian graphs

4. Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

5. Characterizing forbidden pairs for hamiltonian properties

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Big Change: Web 3.0 Era;Web 3.0: Concept, Content and Context;2024