File: gr_connexe

package info (click to toggle)
wims 2%3A4.29a%2Bdfsg1-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 185,704 kB
  • sloc: xml: 366,687; javascript: 120,570; ansic: 62,341; java: 62,170; sh: 7,744; perl: 3,937; yacc: 3,217; cpp: 1,915; lex: 1,805; makefile: 1,084; lisp: 914; pascal: 601; python: 520; php: 318; asm: 7
file content (15 lines) | stat: -rw-r--r-- 471 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
!!abstract,linked gloses,internal links,content,dynamic examples,...
!set gl_author=Euler, Acadmie de Versailles
!set gl_keywords=graph
!set gl_title=Graphe connexe
!set gl_level=H6 Gnrale Experte
:
:
:
:<div class="wims_defn">
  <h4>Dfinition</h4>
    Un graphe \(G\) est dit <strong>connexe</strong> lorsqu'il existe une chane
    entre deux sommets quelconques de <span class ="nowrap">\(G\).</span>
</div>

:mathematics/discrete_mathematics/fr/gr_connexe_1