Kanejuku
Registreerunud: 8. august 2014
Eemaldatud sisu Lisatud sisu
Resümee puudub |
proov |
||
18. rida:
Korrutada algne [[graafi seosmaatriks]] <math>E^1</math> iseendaga, kus <math>E^1\cdot E^1= E^2</math> ja <math>E^{n-1}\cdot E^1= E^n</math>.
The '''fundamental property''' of the graph is its '''[[structure]]''' as the attribute of ''[[organization]]'' the discrete object in the form of ''relationships between its elements''.
Structure as such itself is presentable in the form of a graph '''G''' where [[isomorphism|isomorphic]] graphs have the same structure.
The main characteristics of structure are its '''[[symmetry]]''' properties consisting in ''similar elements (i.e. nodes, node pairs)'' that on the aspect of [[group theory]] to ''orbits (or transitivity domains, equivalence classes, positions etc'') called.
| |||