Образец материалов для подготовки преподавателей к лекции

Definition and Notation

A simple graph is agraph that does not have any loopsor paralleledges.In asimple graph, an edge with endpoints v and w isdenoted{v,w}.

Shunday qilib graf erkin konstruksiyalardir. Bunda ikki uchlari orasidagi bog’lanishning bo’lishi muhimdir, bir xilda ushbu bog’lanishni xarakteri muhimdir.

Agar graf sirtmoqsiz yoki qirralari karrali bo’lmasa, bunda graf oddiy graf deyiladi. Graf kvadrat jadval shaklida bo’lishi mumkin.

Definition A graph H issaid to be a subgraph of a graph G if, and only if, every vertex in H is also a vertex in G, ever y edge in H is also an e dge in G, an d every edge in H has the same en dpoints as it has in G.

• Definition A graph H issaid to be a subgraph of a graph G if, and only if, every vertex in H is also a vertex in G, ever y edge in H is also an e dge in G, an d every edge in H has the same en dpoints as it has in G.
• Example 10.1.11 Subgraphs List all subgraphs of the graph G with vertexset{v1,v2}and edge set{e1,e2,e3}, where the endpoints of e1 are v1 and v2, the endpoints of e2 are v1 and v2, and e3 is a loop at v1.