Search Results - "Cvetković Dragoš"

Towards a spectral theory of graphs based on the signless Laplacian, II by CVETKOVIC, Dragoš, SIMIC, Slobodan K

“…A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a matrix M which is in a prescribed way defined for any graph. This…”
Get full text

Compositions of Cospectrality Graphs of Smith Graphs by CVETKOVIC, Dragoš, JEROTIJEVIC, Marija

“…Graphs whose spectrum belongs to the interval [−2, 2] are called Smith graphs. Vertices of the cospectrality graph C(H) of a Smith graph H are all graphs…”
Get full text

Constructing graphs with given spectrum and the spectral radius at most 2 by Cvetkovic, Dragoš, Jovanovic, Irena M

“…Two graphs are cospectral if their spectra coincide. The set of all graphs that are cospectral to a given graph, including the graph by itself, is the…”
Get full text

SPECTRAL THEORY OF SMITH GRAPHS by CVETKOVIĆ, DRAGOŠ

“…Graphs whose spectrum belongs to the interval [􀀀2, 2] are called Smith graphs. The structure of a Smith graph with a given spectrum depends on a system of…”
Get full text

THREE EXAMPLES OF A GROUND-BREAKING IMPACT OF THE VARIABLE NEIGHBORHOOD SEARCH ON INVESTIGATIONS IN GRAPH THEORY by CVETKOVIĆ, DRAGOŠ

“…The well known computer packageAutoGraphiX(AGX) uses the variable neighborhood search to solve extremal problems in graph theory. We describe how AGX, in its…”
Get full text

Slobodan SimiĆ: an appreciaton by CvetkoviĆ, Dragoš M., Rowlinson, Peter

Get full text

THE AWARD OF THE SERBIAN ACADEMY OF SCIENCES AND ARTS FOR MATHEMATICAL AND RELATED SCIENCES FOR 2013 by Cvetković, Dragoš

Get full text

Finding minimal branchings with a given number of arcs by Cvetković Dragoš M., Čangalović Mirjana M.

“…We describe an algorithm for finding a minimal s-branching (where s is a given number of its arcs) in a weighted digraph with an a symetric weight matrix. The…”
Get full text

Graph spectra in Computer Science by CVETKOVIC, Dragoš, SIMIC, Slobodan

“…In this paper, we shall give a survey of applications of the theory of graph spectra to Computer Science. Eigenvalues and eigenvectors of several graph…”
Get full text

Signless Laplacians of finite graphs by Cvetković, Dragoš, Rowlinson, Peter, Simić, Slobodan K.

“…We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for developing a spectral theory of graphs based on this matrix. For…”
Get full text

TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, III by Cvetkovic, Dragos, Simic, Slobodan

“…This part of our work further extends our project of building a new spectral theory of graphs (based on the signless Laplacian) by some results on graph…”
Get full text

THE TRAVELING SALESMAN PROBLEM: THE SPECTRAL RADIUS AND THE LENGTH OF AN OPTIMAL TOUR by CVETKOVIĆ, DRAGOŠ, DRAŽIĆ, ZORICA, KOVAČEVIĆ-VUJČIĆ, VERA, ČANGALOVIĆ, MIRJANA

“…We consider the symmetric traveling salesman problem (TSP) with instances represented by complete graphs with distances between cities as edge weights…”
Get full text

Slobodan Simić: An Appreciation by Cvetković, Dragoš, Rowlinson, Peter

“…Slobodan Simić had many interests and many friends. Doubtless each of his 66 co-authors has a story to tell, but here we can offer only our own personal…”
Get full text

Graphs with least eigenvalue −2: Ten years on by Cvetković, Dragoš, Rowlinson, Peter, Simić, Slobodan

“…The authors' monograph Spectral Generalizations of Line Graphs was published in 2004, following the successful use of star complements to complete the…”
Get full text

On some algorithmic investigations of star partitions of graphs by Cvetković, Dragos̆, Rowlinson, Peter, Simić, Slobodan

“…Star partitions of graphs were introduced in a recent paper by the same authors in order to extend spectral methods in algebraic graph theory. Here it is shown…”
Get full text

SPECTRAL RECONSTRUCTION AND ISOMORPHISM OF GRAPHS USING VARIABLE NEIGHBOURHOOD SEARCH by CAPOROSSI, GILLES, CVETKOVIĆ, DRAGOŠ, ROWLINSON, PETER

“…The Euclidean distance between the eigenvalue sequences of graphs G and H, on the same number of vertices, is called thespectral distancebetween G and H. This…”
Get full text

Complexity indices for the traveling salesman problem continued by Cvetković Dragoš, Dražić Zorica, Kovačević-Vujčić Vera

“…We consider the symmetric traveling salesman problem (TSP) with instances represented by complete graphs G with distances between cities as edge weights. A…”
Get full text

Spectral recognition of graphs by Cvetković Dragoš

“…At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are…”
Get full text

A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph by Cardoso, Domingos M., Cvetković, Dragoš, Rowlinson, Peter, Simić, Slobodan K.

“…We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non-bipartite graph with a prescribed number of vertices is…”
Get full text

Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal by Yoon, Myung-Gon, Rowlinson, Peter, Cvetković, Dragoš, Stanić, Zoran

“…This paper is concerned with the controllability of a multi‐agent dynamical system in which all identical first‐order dynamical agents receive a common…”
Get full text