http://pco.iis.nsk.su/grapp/index.php?title=Leaf&feed=atom&action=historyLeaf - История изменений2024-03-29T00:05:25ZИстория изменений этой страницы в викиMediaWiki 1.39.3http://pco.iis.nsk.su/grapp/index.php?title=Leaf&diff=7873&oldid=prevGlk: Новая страница: «'''Leaf''' --- лист. '''1.''' See '' Directed tree''. '''2.''' A ''' leaf''' is a vertex of degree one. '''3.''' See '' Directed hyperpath''. '''4.''' A '''…»2011-05-26T08:16:08Z<p>Новая страница: «'''Leaf''' --- лист. '''1.''' See '' Directed tree''. '''2.''' A ''' leaf''' is a vertex of degree one. '''3.''' See '' Directed hyperpath''. '''4.''' A '''…»</p>
<p><b>Новая страница</b></p><div>'''Leaf''' --- лист. <br />
<br />
'''1.''' See '' Directed tree''.<br />
<br />
'''2.''' A ''' leaf''' is a vertex of degree one.<br />
<br />
'''3.''' See '' Directed hyperpath''.<br />
<br />
'''4.''' A ''' leaf''' is any 2-edge-connected subgraph, trivial or not, maximal with respect<br />
to inclusion. Thus every vertex belongs to a unique leaf of a graph.<br />
The number of leaves of <math>H</math> is denoted by <math>l(H)</math>.</div>Glk