183 results on '"Simić, Slobodan K."'
Search Results
2. Tridiagonal Matrices and Spectral Properties of Some Graph Classes
3. Vertex types in threshold and chain graphs
4. LEXICOGRAPHIC POLYNOMIALS OF GRAPHS AND THEIR SPECTRA
5. On the Spectral Invariants of Symmetric Matrices with Applications in the Spectral Graph Theory
6. On eigenspaces of some compound signed graphs
7. Eigenvalue location for chain graphs
8. Polynomial reconstruction of signed graphs
9. Signed line graphs with least eigenvalue [formula omitted]: The star complement technique
10. A note on connected bipartite graphs of fixed order and size with maximal index
11. Reflexive Line Graphs of Trees and Salem Numbers
12. On eigenvalue inequalities of a matrix whose graph is bipartite
13. On the Laplacian coefficients of signed graphs
14. Notes on the second largest eigenvalue of a graph
15. MORE ON NON-REGULAR BIPARTITE INTEGRAL GRAPHS WITH MAXIMUM DEGREE 4 NOT HAVING ±1 AS EIGENVALUES
16. Reflexive line graphs of trees
17. GRAPH SPECTRAL TECHNIQUES IN COMPUTER SCIENCES
18. ON THE SPECTRAL RADIUS OF CACTUSES WITH PERFECT MATCHINGS
19. A Note on the Second Largest Eigenvalue of Star-Like Trees
20. TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, III
21. ON Q-INTEGRAL (3, s)-SEMIREGULAR BIPARTITE GRAPHS
22. On ordering bicyclic graphs with respect to the Laplacian spectral radius
23. INDICES OF TREES WITH A PRESCRIBED DIAMETER
24. ANALYSIS OF COMBINATIONAL NETWORKS WITH MATHEMATICA
25. ERRATA: A SURVEY ON INTEGRAL GRAPHS
26. Spectral determination of graphs whose components are paths and cycles
27. Graphs for small multiprocessor interconnection networks
28. On the spectral radius of quasi- k-cyclic graphs
29. Combinatorial approach for computing the characteristic polynomial of a matrix
30. Connected graphs of fixed order and size with maximal index: Some spectral bounds
31. On the spectral radius of unicyclic graphs with prescribed degree sequence
32. Some notes on the threshold graphs
33. Trees with minimal index and diameter at most four
34. On some forests determined by their Laplacian or signless Laplacian spectrum
35. Relations between (κ, τ)-regular sets and star complements
36. Graphs for which the least eigenvalue is minimal, II
37. On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by −2
38. A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
39. Q-integral graphs with edge–degrees at most five
40. On the index of caterpillars
41. Parastrophically uncancellable quasigroup equations
42. On the Index of Necklaces
43. Some notes on graphs whose index is close to 2
44. Signless Laplacians of finite graphs
45. Graphs With Least Eigenvalue —2: A New Proof of the 31 Forbidden Subgraphs Theorem
46. Some results on the index of unicyclic graphs
47. Functional equations and their graphs
48. Graphs With Least Eigenvalue −2: A New Proof of the 31 Forbidden Subgraphs Theorem
49. Which non-regular bipartite integral graphs with maximum degree four do not have ±1 as eigenvalues?
50. A Note on Reconstructing the Characteristic Polynomial of a Graph
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.