Open Access

Underlying Simple Graphs

  
Feb 17, 2020

Cite
Download Cover

In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.

Language:
English
Publication timeframe:
1 times per year
Journal Subjects:
Computer Sciences, Computer Sciences, other, Mathematics, General Mathematics