Copyright © Philip M. Parker, INSEAD. Terms of Use.

BICONNECTED COMPONENT

Specialty Definition: BICONNECTED COMPONENT

DomainDefinition

Math

A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex. (references)

Source: compiled by the editor from various references; see credits.

Top     

Alternative Orthography: BICONNECTED COMPONENT


Hexadecimal (or equivalents, 770AD-1900s) (references)

42 49 43 4F 4E 4E 45 43 54 45 44      43 4F 4D 50 4F 4E 45 4E 54

Leonardo da Vinci (1452-1519; backwards) (references)

    

Binary Code (1918-1938, probably earlier) (references)

01000010 01001001 01000011 01001111 01001110 01001110 01000101 01000011 01010100 01000101 01000100 00100000 01000011 01001111 01001101 01010000 01001111 01001110 01000101 01001110 01010100

HTML Code (1990) (references)

&#66 &#73 &#67 &#79 &#78 &#78 &#69 &#67 &#84 &#69 &#68 &#32 &#67 &#79 &#77 &#80 &#79 &#78 &#69 &#78 &#84

ISO 10646 (1991-1993) (references)

0042 0049 0043 004F 004E 004E 0045 0043 0054 0045 0044      0043 004F 004D 0050 004F 004E 0045 004E 0054

Encryption (beginner's substitution cypher): (references)

36433749484839375439382374947504948394854

Top     



INDEX

1. Orthography
2. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.