Faculty of Information and Communication Technology;
Poland;
Wroclaw;
Wroclaw University of Science and Technology;
Warsaw;
Department of Applied Informatics;
Central Statistical Office;
关键词：
graph edge and vertex overloading;
multi-edge;
node labeling;
information graph reduction;
information graphs;
Edge labeling;
Hamilton cycle;
information graph description language (MOBSIG);
security conflict graph;
potential security conflict;
topic graph;
graph isomorphism;
information graph concatenation;
期刊名称：
Cybernetics and Systems: An International Journal
i s s n：
0196-9722
年卷期：
2024 年
55 卷
1/4 期
页 码：
678-692
页 码：
摘 要：
The paper defines the concept of an information graph and proposes its use to describe information links and analyze the information flow in any organization regarding information security. Research on information graphs in this aspect should be developed, especially in identifying "dangerous graph structures" such as the Hamiltonian graphs or cliques. Information graphs containing such a structure as a Hamilton cycle can be analyzed using results from the theory of finding and existence of Hamilton cycles, an essential branch of graph theory. The paper also describes a graph of potential security conflicts, a thematic graph, i.e. a specific information graph. Two theorems concerning the properties of information graphs are also proved.
分享
载入中，请稍后...
