12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Monday November 25, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Futures Of Logical Graphs (view source)
Revision as of 03:54, 28 July 2009
, 03:54, 28 July 2009→Introduction: fix typo
|}
|}
The outermost region of the plane-embedded graph is singled out for special consideration and the corresponding node of the dual graph is referred to as its ''root node''. By way of graphical convention in the present text, the root node is indicated means by means of a horizontal strike-through.
The outermost region of the plane-embedded graph is singled out for special consideration and the corresponding node of the dual graph is referred to as its ''root node''. By way of graphical convention in the present text, the root node is indicated by means of a horizontal strike-through.
Extracting the dual graph from its composite matrix, we get this picture:
Extracting the dual graph from its composite matrix, we get this picture:
