Documente Academic
Documente Profesional
Documente Cultură
Grafuri
7.1.
1.
25
a.
2.
a.
3.
a.
4.
a.
5.
a.
66
b.
65
c.
d.
26
b.
c.
d.
b.
c.
d.
d.
6.
a.
7.
a.
m=n+2
b.
b.
c.
n=m-1
c.
1
n=m+1
d.
n=m+2
8.
a.
9.
a.
b.
c.
b.
c.
1:
2:
3:
4:
5:
6:
2
1
2
2
1
1
5
3
4
3
4
3
d.
6
4
6
5
6
5
d.
Numrul vrfurilor de grad par este egal cu numrul vrfurilor de grad impar.
Matricea de adiacen asociat grafului G nu este simetric fa de diagonala
secundar.
Cel mai scurt lan de la vrful 1 la vrful 4 are lungimea 3
d.
12.
a.
13.
a.
b.
c.
0
1
0
0
0
1
1
1
0
0
0
0
1
1
0
0
0
1
0
0
0
0 0
0 0
1 0
0 0
0 0
0 0
0 0
d.
1
1
0
0
0
0
1
2
1
1
0
0
0
1
0
b.
c.
d.
14
b.
c.
10
d.
b.
c.
d.
3,6,8,10,12
1,4,7,9,11
2,5,3,6,8,10,12
2,5
b.
d.
18. V_70_I_1.Se
consider
graful
neorientat
G=(X,U)
unde
X={1,2,3,4,5,6} i U={(1,2),(1,3),(6,5),(3,4),(4,5),(4,6)}.
Stabilii care este numrul maxim de muchii care pot fi eliminate pentru a se
obine un graf parial care s fie conex a lui G.
a.
b.
c.
d.
1 2 3 4
b.
1 2 12 12
c.
5 5 5 5 5
b.
c.
d.
d.
0
0
1
0
0
0
0
0
0
0
0
1
1
1
1
1
4 4 4 4 4
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
1
0
0
0
0
1
0
0
1
0
0
0
0
0
1
0
1
0
0
1
0
0
0
0
1
0
1
0
1
0
0
b.
c.
d.
22. V_81_I_2. Un graf neorientat i conex are n noduri i n-1 muchii. Care este
numrul minim de muchii ce trebuie adugate astfel nct s se obin un
ciclu?
a. n 2 3 n 2
b. n (n 1)
c. 0
d. 1
1, 6, 2, 3, 6, 5
c.
1, 3, 6, 5
b.
1, 2, 6, 3, 5
d.
1, 5
25.
a.
26.
a.
b.
c.
4
d.
28.
a.
b.
c.
exact 15
d.
a.
b.
c.
d.
0
1
1
0
0
1
0
1
0
0
1
1
0
0
0
0
0
0
0
1
0
0
0
1
0
n*(n-1)/2
b.
n*n/2
c.
n*(n+1)/2
d.
n*n
31. V_20_I_2. ntr-un graf neorientat cu 6 noduri oricare dou noduri x, y sunt
adiacente dac i numai dac
x mod 2=y mod 2
x%2==y%2
a.
ciclic
b.
hamiltonian
c.
eulerian
0
1
0
0
1
d.
1
0
1
1
0
0
1
0
1
1
0 1
1 0
1 1
0 1
1 0
d. conex
b.
c.
d.
d.
b.
c.
b.
c.
a.
d.
d.
d.
b.
c.
6 linii i 3coloane
6 linii i 4 coloane
b.
d.
b.
d.
4 linii i 4 coloane
6 linii i 6 coloane
1:(3,5);
5:(3);
2:(4);
6:(7);
3:(1,5);
7:(6);
4:(2);
8:
1 component conex
3 componente conexe
20
b.
10
c.
19
d.
190
b.
c.
d.
2n(n-1)/2
-1
b.
2n(n+1)/2
c.
2n(n-1)/2
d.
2n(n-1)/2 -1
exact n(n-1)/2 -m
maximum n(n-1)/2 -m
b.
d.
minimum n(n-1)/2 -m
exact n-m
n!
b.
2n
c.
m!
d.
2m
b.
c.
d.
12
53. V_13_I_6. Care dintre urmtoarele grafuri este un graf eulerian, dar nu
este hamiltonian? Grafurile sunt precizate prin numrul n de noduri i
mulimea U a muchiilor.
a.
n=3, U={[1,2],[1,3],[2,3]}
b.
n=4, U={[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]}
c.
n=5, U={[1,3],[1,4],[3,4],[2,4],[4,5],[2,5]}
d.
b.
c.
d.
b.
c.
d.
d.
n*(n-1)/2
b.
[(n+1)/2]
c.
n-1
d.
[n/2]+1
d(x1)+d(x2)+d(x3)+...+d(xn)=m-n
b.
d(x1)+d(x2)+d(x3)+...+d(xn)=m-1
c.
d(x1)+d(x2)+d(x3)+...+d(xn)>n*(n-1)
d.
59. V_41_I_5. Fie un graf neorientat cu n vrfuri (n>1). Cte valori 1 apar n
matricea de adiacen a grafului dac exist muchie ntre oricare dou
vrfuri distincte?
a.
n*(n-1)/2
b.
n2
c.
d.
n*(n-1)
c. graf neconex
d. graf eulerian
61. V_86_I_2. Se consider graful neorientat reprezentat 0 1 1
1 0 1
prin matricea de adiacen alturat; atunci graful este
1 1 0
(nu
conine 1 0 0
a. eulerian
b. aciclic
niciun ciclu)
0 1 0
c. arbore
d. hamiltonian
1
0
0
0
1
0
1
0
1
0
62. V_32_I_7.
Se
consider
graful
neorientat:
G=(X,U)
cu
X={1,2,3,4,5,6,7} i U={[1,3], [2,3], [3,4], [3,5],
[5,4], [1,2], [2,5], [2,4], [6,7], [3,6]}. Care dintre
urmtoarele succesiuni de noduri reprezint un lan hamiltonian n graful
dat?
a.
c.
(7, 6, 3, 5, 4, 2, 1)
(1, 3, 5, 4, 2, 3, 6)
b.
d.
(1, 2, 3, 4, 5, 6, 7)
(4, 5, 3, 6, 7)
a.
b.
c.
d.
a.
0
1
1
0
0
0
1
d.
b.
c.
10
1
0
1
1
0
0
1
1
1
0
0
0
1
0
0
1
0
0
1
0
1
0
0
0
1
0
1
0
1:(2,3,5)
2:(1,4)
3:(1,4,5)
4:(2,3,5)
5:(1,3,4)
0
0
1
0
1
0
0
1
1
0
1
0
0
0
a.
b.
c.
G este eulerian
G nu este hamiltonian
b.
d.
0
1
1
1
1
G nu este conex
G este aciclic
b.
d.
G este aciclic
G este eulerian
b.
d.
b.
c.
d.
11
1
0
0
1
0
0 1 1
1 0 1
1 1 0
1 0 0
1 0 0
G este eulerian
G este hamiltonian
1
0
0
0
1
1
0
0
1
0
0
1
1
0
1
1
0
1
0
0
1
1
0
0
0
1
0
0
0
1
1
0
1
0
0
1
1
0
0
0
0
0
0
0
1
1
0
0
1
0
G este conex
G este aciclic
d.
G este conex
G este hamiltonian
7.2.
1.
a.
b.
c.
d.
2.
V_18_I_3. Suma gradelor interne ale tuturor vrfurilor unui graf orientat este
totdeauna egal cu:
a.
b.
c.
d.
3.
a.
2, 4, 5
b.
2, 4, 5, 6
c.
1, 4, 5
4.
a.
2n
5.
b.
2 n n 1
b.
c.
d.
a.
b.
n n 1
2
1
0
1
0
1
1
1
1
0
0
0
0
0
1
1
0
0
0
0
0
0
1
0
1
0
1
0
0
0
0
d.
1, 3, 6
d.
2n
a.
6.
c.
0
0
1
0
0
0
12
7.
a.
8.
a.
9.
a.
b.
c.
0
1
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
0
0
1
0
1
0
1
0
0
0
0
d.
b.
c.
d.
c.
d.
V_27_I_7.
Considernd
graful
orientat din figura alturat, stabilii
cte dintre vrfurile grafului au gradul
extern (exterior) egal cu gradul intern
(interior).
2
b.
a.
b.
c.
13
20
d.
17
a.
b.
c.
0
0
0
0
0
0
(4 , 1)
b.
c.
(5 , 3)
1
0
0
0
0
1
1
0
0
1
1
0
0
1
0
0
0
0
d.
0
0
0
0
1
0 1
1 0
0 0
0 0
0 0
(3
1
0
0
0
0
d.
0
1
0
0
0
1
0
1
0
1
0
0
0
0
0
1
0
, 2)
a.
b.
c.
d.
18. V_9_I_2. Fie graful orientat G=(V,E) unde mulimea nodurilor este
V={1,2,3,4,5,6,7}, iar mulimea arcelor este E={[1,2],[1,6],[2,5],
[2,6],[3,4],[4,3],[6,2], [6,5],[3,7],[4,7]}. Numrul nodurilor
grafului G care au gradul exterior egal cu 0 este:
a.
b.
c.
14
d.
19.
a.
b.
2
4
a.
c.
b.
d.
5
2
2
2
1
c.
20.
1:
2:
3:
4:
5:
6:
1
3
0
1
0
0
0
1
1
0
0
1
0
0
4
3
4
2 3 4 5
d. 2
0
1
0
1
0
1
0
0
1
0
1
1
0
0
0
1
0
0
0
1
1
0
1
0
21. V_16_I_7. Lungimea unui drum elementar ntr-un graf orientat cu n vrfuri
poate fi:
a.
b.
n+1
c.
a.
b.
c.
a.
b.
c.
0
0
0
0
0
0
0
0
1
0
n-1
d.
0
1
0
1
0
1
0
0
0
0
4
d.
0
0
0
0
1
1
0
1
0
0
1
0
0
0
0
d.
1
1
0
0
0
0
1
1
0
1
0
0
0
0
0
4
a.
b.
c.
d.
b.
c.
15
d.
b.
c.
b.
7,8
5,6,4
1:
2:
3:
4:
c.
4, 5, 6
3, 4
4
3, 6
5: 4, 1
6: 1, 4
7: 1, 8
8:
3,4,6
d.
b.
d.
c.
1:
2:
3:
4:
5:
d.
b.
d.
5
4
5
1, 2
2, 3, 4
3
0
1
1
0
0
0
1
1
0
0
0
1
1
0
0
0
b.
c.
un graf parial
d.
un subgraf
cu dou noduri i
niciun arc
un subgraf cu cinci noduri i trei
arce
1,5,4,3
b.
1,2,4,3
c.
16
5,4,3,1
0
0
0
0
0
d.
1 0 0 0
0 0 1 0
0 0 0 0
1 1 0 0
0 0 1 0
2,4,3,1
32. V_38_I_4. ntr-un graf orientat cu n noduri, gradul extern al unui vrf poate
fi maximum:
a.
n-1
b.
c.
n+1
d.
b.
c.
gradul nodului k
b.
c.
d.
1:
2:
3:
4:
5:
d.
nr0
citete k
{k natural,kn}
pentru i1,n execut
dac aki=1 atunci
nr nr+1
6:
7:
8:
9: 8
10:
6
7 9
a.
b.
c.
d.
1
1
1
0
0
1
1
1
0
0
1
1
1
0
0
1
1
1
1
1
1
1
1
1
1
b.
0
1
1
0
0
1
0
1
0
0
1
1
0
0
0
1
1
1
0
1
1
1
1
1
0
c.
17
1
1
1
0
0
1
1
1
0
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
d.
0
0
1
0
0
1
0
0
0
0
0
1
0
0
0
0
0
1
0
1
0
0
0
1
0
b.
2*m
c.
m/2
(5,2)
b.
(5,4)
c.
d.
(4,5)
0
1
0
1
0
1
0
1
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
(2,5)
d.
0
0
0
0
1
1
0
1
0
1
0
0
0
0
0
1
0
a.
b.
c.
d.
b.
c.
d.
b.
c.
18
d.
44. V_46_I_1. Fie graful orientat G cu n=5 noduri, dat prin urmtoarele liste de
adiacen: 1: (2, 3), 2: (3, 4), 3: (4, 5), 4: (1, 2), 5: (4).
Care dintre urmtoarele propoziii este fals?
a.
exist cel puin un nod n graful G care are gradul intern egal cu cel extern
b.
exist cel puin un drum ntre oricare dou noduri ale grafului G
c.
d.
b.
c.
d.
d.
b.
c.
a.
b. 2
c. 3
d. 0
V_4_I_6. Un graf orientat are 8 arce i fiecare nod al grafului are gradul
interior un numr nenul. Doar dou dintre noduri au gradul interior un numr
par, restul nodurilor avnd gradele interioare numere impare. Care este
numrul maxim de noduri pe care poate s le aib graful?
7
b.
c.
19
d.
b.
c.
d.
b.
c.
c.
b.
d.
20
d.
54.
10
c.
b.
d.
b.
c.
6 5
b.
5 4
c.
0
1
0
0
0
1
d.
1
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
1
0
4 6
d.
0
1
0
0
0
0
1
0
0
0
0
0
4 5
b.
1 5
c.
1 2 3 5
d.
1:(2,3)
2:(1,3,5)
3:(1,2,4)
4:(3,5)
5:(2,4)
b.
c.
d.
21
4 5
3
0
0
1
0
0
1
0
0
0
1
0
1
0
1
0
0
1
0
0
0
1
0
0
1
0
a.
b.
c.
d.
60. V_77_I_3 Fie graful orientat cu 8 vrfuri i arcele [1,2], [2,3], [3,1],
[4,5], [5,6],[5,7],[6,7],[7,4],[8,7]. Numrul de vrfuri cu
proprietatea c gradul interior este egal cu gradul exterior este:
a.
b.
c.
d.
61.
3,6,7
a.
b.
c.
d.
62.
a.
b.
c.
0
0
0
0
0
d.
4
1 0
0 0
1 0
1 1
1 0
3
1
0
0
0
1
0
1
0
0
0
b.
c.
d.
b.
1 5
c.
1 2 3 5
d.
4 5
65. V_70_I_2.
Se
consider
graful
orientat
G=(X,U)
unde
X={1,2,3,4,5,6,7,8,9} i U={(2,1), (1,6), (2,5), (2,3),
(3,4), (4,6), (5,7), (4,8), (8,9)}.
Care sunt nodurile legate de nodul 2 prin drumuri a cror lungime este egal
cu cea a drumului de lungime minim dintre nodurile 2 i 6 ?
a.
7 4
b.
8 2
c.
22
5 8 9
d.
1 5 3
66.
a. 1,2,5,7,8
b.
1,2,5,6,8
2,5,6,7,8
d.
1,2,5,7,6
c.
0
0
0
0
0
0
1
0
2, 3, 5
d.
2, 3, 4
0
0
0
0
0
1
1
0
1
0
0
0
1
0
0
0
0
1
0
0
0
1
0
1
0
1
0
1
0
0
0
0
1
0
0
0
1
0
1
1
0
0
0
0
1
0
0
1
0
0
0
1
0
0
0
0
1
0
0
1
0
0
0
0
1
0
0
0
1
0
0
1
0
1
1
0
0
0
0
0
0
0
0
0
0
0
0
1
1
0
1
0
b.
c.
d.
b.
c.
d.
0
1
0
0
1
0
d.
1
0
1
1
1
0
0
0
0
0
0
1
0
1
0
0
0
1
1
0
1
0
0
0
0
0
1
0
0
0
1, 2 i 4
b.
c.
23
3 i 4
d.
3 i 2
7.3.
1.
a.
2.
a.
b.
c.
d.
3.
1
0
0
0
0
1
0
1
1
0
0
0
0
0
1
0
b.
0
0
0
1
1
0
0
0
0
1
0
0
c.
0
1
1
1
1
0
1
0
1
1
0
0
1
0
0
0
0
0
1
0
d.
0
0
0
1
1
0
0
1
0
1
1
0
a.
b.
c.
d.
0
1
1
0
0
0
0
1
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
1
0
0
0
0
1
1
0
5.
a.
40320
b.
b.
exact n-1
c.
28
c.
exact 1
d.
d.
0 sau 1
6.
a.
c.
b.
d.
24
7.
a.
8.
a.
9.
a.
b.
c.
25
d.
1, 1, 3, 1, 0
4, 3, 2, 1, 1
b.
d.
4, 1, 5, 1, 2
2, 1, 1, 3, 1
16. V_25_I_3. Numrul de noduri ale unui arbore cu 100 de muchii este:
a.
101
99
b.
c.
100
d.
50
b.
p elemente nule
c.
p -p elemente nule
d.
18. V_17_I_7. Care este gradul maxim posibil al unui nod dintr-un arbore cu n
noduri?
a. n-1
b. n DIV 2 | n/2
c. 2
d. n
19. V_24_I_6.Care dintre matricele de adiacen de mai jos corespunde unui
arbore cu 4 noduri?
a. 0 0 1 1
b. 0 0 1 0
c. 0 0 1 0
d. 0 0 1 0
0 0 1 0
0 0 1 0
0 0 0 1
0 0 1 0
1 1 0 1
1 1 0 0
1 0 0 0
1 1 0 1
1 0 1 0
0 0 0 0
0 1 0 0
0 0 1 0
20.
a.
21.
a.
22.
a.
b.
12
c.
26
10
d.
11
23. V_47_I_2. Cte cicluri elementare care difer prin cel puin o muchie se
formeaz prin adugarea unei singure muchii la un arbore (ciclul este
elementar dac este format numai din noduri distincte, excepie facnd
primul i utimul)?
a.
24.
a.
b.
c.
d.
b.
c.
d.
0
1
0
1
0
0
0
1
0
1
1
1
0
0
0
1
0
1
0
0
1
1
1
1
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
1, 2, 8
b.
3, 4, 7
c.
d.
c.
d.
27
28.
a.
29.
a.
b.
c.
0
1
1
1
0
0
0
1
0
0
0
1
1
0
1
0
0
1
0
0
1
1
0
1
0
0
0
0
d.
0
1
0
0
0
0
0
0
1
0
0
0
0
1
3
0
0
1
0
0
1
0
30. V_95_I_2.Cte
lanuri
elementare
de
lungime
maxim ce leag dou noduri
ale arborelui din figura
alturat exist?
a. 8
b. 6
c.
10
d.
4
0 1 1
1 0 0
1 0 0
1 0 0
0 0 1
0 0 0
0 0 0
(0,1,3,1,1,5,5)
(0,1,1,1,5,3,3)
a.
c.
(0,1,1,1,3,5,5)
(0,1,5,5,3,3,5)
b.
d.
1
0
0
0
0
0
0
0
0
1
0
0
1
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
28
b.
c.
d.
t:
6,7
b.
1,4,8,9
c.
d.
2,3
1122316
b.
0122416
c.
0122216
d.
0123456
38. V_28_I_8.
Stabilii care
dintre urmtorii vectori este
vector de tai pentru arborele
cu rdcina 7 din figura
alturat.
a.
c.
2 6 4 5 7 7 0 5
2 6 3 5 7 7 0 5
b.
d.
1 2 4 5 6 7 0 3
2 6 7 3 4 5 0 8
29
7 8
b.
9 10
c.
1 7 10
d.
1 7 8 9 10
b.
c.
a.
c.
45.
a.
c.
d.
d.
b.
d.
(2,3,0,3,4,5,6,7)
(3,1,0,3,3,3,4,4)
46. V_86_I_8.
Fie
un
arbore
precizat
prin
vectorul
de
tai
T=(0,1,2,5,2,8,8,2). Care este numrul maxim de descendei direci ai
unui nod din arbore?
a.
b.
c.
30
d.
47. V_87_I_2. Care din urmtorii vectori NU poate fi vectorul de tai pentru un
arbore cu 6 noduri?
a.
c.
T=[3,3,0,3,3,3]
T=[0,1,5,1,3,2]
b.
d.
T=[2,0,1,2,3,4]
T=[2,3,4,5,6,0]
a.
b.
4 1 1 0 2
c.
3 4 0 2 3
d.
3 1 0 1 2
0 5 7 4 0 0 3
b.
0 5 7 0 4 3 3
c.
2 0 2 5 5 3 3
d.
2 0 2 5 2 3 3
a.
2n-1
b.
c.
2n
d.
2n-1
54. V_14_I_4. Care dintre urmtorii vectori poate reprezenta vectorul de tai al
unui arbore cu rdcin?
a. (5,7,1,1,0,7,7,12,1,12,4,7) b. (5,7,1,1,0,7,0,12,1,12,4,7)
31
c. (5,7,1,1,0,7,5,12,1,12,4,7) d. (0,7,1,1,8,7,5,12,1,12,4,7)
55. V_15_I_2. Se consider arborele cu 14 noduri avnd urmtoarele muchii:
[3,4], [4,14], [14,13], [4,5], [1,5], [5,7], [2,7],
[6,7], [6,9], [8,9], [9,12], [11,12], [10,12]. Care dintre
vectorii urmtori reprezint vectorul de tai al arborelui dat?
(5,7,4,5,0,7,5,9,6,12,12,11,14,4)
a.
(5,7,4,0,4,7,5,9,6,0,12,9,14,4)
b.
(0,7,4,5,1,7,5,9,6,11,12,9,14,4)
c.
(5,7,4,5,7,9,6,9,12,12,12,0,14,4)
d.
56.
a.
b.
1,4,6,8,9
2,3,4,5,6
c.
d.
2,6,7,8,9
57. V_22_I_7.
Se consider vectorul de tai al unui arbore
oarecare t=(0,3,1,3,1), n care nodurile sunt numerotate cu
1,2,3,4,5. Alegei afirmaia incorect :
a.
b.
c.
d.
a.
V_23_I_7.
Se consider vectorul de tai al unui arbore
oarecare t=(0,3,1,3,1,5), n care nodurile sunt numerotate de la 1 la 6.
Alegei afirmaia corect:
nodurile 2, 4, 6 sunt frai
b. nodul 5 are gradul 1
c.
58.
d.
4 4 1 0 1
b.
4 4 1 2 1
c.
2 3 0 4 3
d.
1 2 0 3 4
b.
c.
d.
32
a.
b.
c.
d.
62.
a.
c.
(4,3,0,3,9,9,6,6,9)
(4,3,2,3,9,9,6,6,3)
b.
d.
(4,3,0,3,9,9,6,6,3)
(4,3,2,3,9,9,6,6,0)
2, 1, 0, 3, 4
5, 4, 2, 1, 3
b.
d.
2, 4, 0, 3, 4
5, 2, 4, 5, 0
tata=(3,3,4,0,2,3,4,4,4)
tata=(3,3,1,3,2,3,4,4,3)
b.
d.
33
tata=(9,9,4,9,9,9,9,9,0)
tata=(3,0,2,3,2,3,4,4,3)