Encapsulation theory: the transformation equations of absolute information hiding

TL;DR

This paper develops mathematical equations to describe how the maximum number of edges in an encapsulated graph changes during transformations involving node creation and modification, providing insights into information hiding.

Contribution

It introduces the transformation equations governing maximum edges in encapsulated graphs, advancing understanding of information hiding mechanisms.

Findings

Derived equations for maximum edges during graph transformations

Analyzed how node creation and modification affect graph structure

Provided a framework for studying information hiding in graphs

Abstract

This paper describes how the maximum potential number of edges of an encapsulated graph varies as the graph is transformed, that is, as nodes are created and modified. The equations governing these changes of maximum potential number of edges caused by the transformations are derived and briefly analysed.