A5100608452- Graph theory and applications
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Ergonomics and Musculoskeletal Disorders
- Graph Theory and Algorithms
- Synthesis and Properties of Aromatic Compounds
- Finite Group Theory Research
- Effects of Vibration on Health
- Matrix Theory and Algorithms
- Musculoskeletal pain and rehabilitation
- Interconnection Networks and Systems
- Computational Drug Discovery Methods
- Topological and Geometric Data Analysis
- History and advancements in chemistry
- Immunodeficiency and Autoimmune Disorders
- graph theory and CDMA systems
- Synthesis and properties of polymers
- Complex Network Analysis Techniques
- Embedded Systems Design Techniques
- Neonatal Respiratory Health Research
- Power System Optimization and Stability
- Optical Network Technologies
- Computational Geometry and Mesh Generation
- Myeloproliferative Neoplasms: Diagnosis and Treatment
- Blood disorders and treatments
Delft University of Technology
2017-2023
University of Belgrade
2002-2021
Mathematical Institute of the Serbian Academy of Sciences and Arts
2008-2021
Universidade do Porto
2018-2021
Portuguese Air Transportations (Portugal)
2021
University Hospital Medical Center Bezanijska kosa
2012-2020
Serbian Academy of Sciences and Arts
2008-2019
University of Split
2016-2018
University of Nis
2004-2018
Union University
2016
This introductory text explores the theory of graph spectra: a topic with applications across wide range subjects, including computer science, quantum chemistry and electrical engineering. The spectra examined here are those adjacency matrix, Seidel Laplacian, normalized Laplacian signless finite simple graph. underlying theme book is relation between eigenvalues structure Designed as an for graduate students, or anyone using spectra, this self-contained treatment assumes only little...
A spectral graph theory is a in which graphs are studied by means of eigenvalues matrix M prescribed way defined for any graph. This called M-theory. We outline based on the signless Laplacians Q and compare it with other theories, particular those adjacency Laplacian L. The Q-theory can be composed using various connections to theories: equivalency A-theory L-theory regular graphs, or bipartite general analogies via line subdivision graphs. present results operations, inequalities...
This article is a survey of results concerning the largest eigenvalue (or index) grapn, catcgoiizeu as follows (1) inequalities lor index, (2) graph with bounded (3) ordering graphs by their indices, (4) operations and modifications, (5) random graphs, (6) applications.
We extend our previous survey of properties spectra signless Laplacians graphs. Some new bounds for eigenvalues are given, and the main result concerns graphs whose largest eigenvalue is maximal among with fixed numbers vertices edges. The results presented in context a number computer-generated conjectures.
A graph whose spectrum consists entirely of integers is called an integral graph. We present a survey results on graphs and the corresponding proof techniques.
The recently developed Variable Neighborhood Search (VNS) metaheuristic for combinatorial and global optimization is outlined together with its specialization to the problem of finding extremal graphs respect one or more invariants corresponding program (AGX). We illustrate potential VNS algorithm on example energy E, a graph invariant which (in case molecular conjugated hydrocarbons) corresponds total π-electron energy. Novel lower upper bounds E are suggested by AGX several conjectures...
This part of our work further extends project building a new spectral theory graphs (based on the signless Laplacian) by some results graph angles, several comments and short survey recent results.