uspešno zastopana na odmevni mednarodni znanstveni konferenci „ International conference on groups graphs
Our methods are based on genome graphs which capture the structure of genome even when its sequence is
theoretical results and various tricks which allowed us to compute census of all cubic vertextransitive graphs
preizskusno predavanje naslovom Distance degree regularity and distancebalanced proriety of graphs
Thegraphtheoretical matrices are convenient devices for the algebraicrepresentation of graphs EUR they
In this talk report some results on vertex transitive quasi Cayley graphs
In the chapter that follows vertex coloring problem and maximum clique problem of graphs are discussed
amalgam satisfying certain additional requirements one can construct all connected locally arctransitive graphs
Predavanje Chromatic properties of Cayley graphs bo vodila prof dr Elena Konstantinova
solution of this problem would lead to complete classification of Qpolynomial distanceregular graphs
In this talk recent classification of tetravalent oneregular graphs of order p where is prime will be
On class of graphs between threshold and total domishold graphs
MRTG will also try to adjust its graphs so that the largest value plotted on the graph is always close
We select small portion of numerous characterizations and properties of median graphs with an emphasis
Graphs in Geometry and Algorithms EuroGIGA CRP projekt Geometric representations and symmetries of graphs