Search

Your search keyword '"Adjacency matrix"' showing total 45 results

Search Constraints

Start Over You searched for: Descriptor "Adjacency matrix" Remove constraint Descriptor: "Adjacency matrix" Publisher taylor & francis ltd Remove constraint Publisher: taylor & francis ltd
45 results on '"Adjacency matrix"'

Search Results

1. On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching II.

2. Permanents of almost regular complete bipartite graphs.

3. On weight-symmetric 3-coloured digraphs.

4. On the eigenvalues of Laplacian ABC-matrix of graphs.

5. On the maximal α-spectral radius of graphs with given matching number.

6. On unicyclic non-bipartite graphs with tricyclic inverses.

7. Trees with the reciprocal eigenvalue property.

8. On tetracyclic graphs having minimum energies.

9. On the inverse of unicyclic 3-coloured digraphs.

10. An efficient class of tree network balanced designs for agroforestry experimentation.

11. Equitable partition and star set formulas for the subgraph centrality of graphs.

12. On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices.

13. Inverses of non-bipartite unicyclic graphs with a unique perfect matching.

14. On the Aα spectral radius of digraphs with given parameters.

15. Spectra of comb graphs with tails.

16. A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph.

17. Star complementary strongly regular decompositions of strongly regular graphs.

18. A topological approach of multiple correspondence analysis.

19. Vertex types in some lexicographic products of graphs.

20. Spectral properties of cographs and P5-free graphs.

21. On the eigenvalues of signed complete graphs.

22. Leading eigenvalues of adjacency matrices of star-like graphs with fixed numbers of vertices and edges.

23. Frame graph.

24. Connected signed graphs of fixed order, size, and number of negative edges with maximal index.

25. On sharp bounds for spectral radius of nonnegative matrices.

26. Bethe graphs attached to the vertices of a connected graph - a spectral approach.

27. A new assessment model for evacuation vulnerability in urban areas.

28. On graphs whose least eigenvalue is greater than –2.

29. On some graphs which possess inverses.

30. A characterization of signed planar graphs with rank at most 4.

31. On the spectra of graphs with edge-pockets.

32. Majorisations for the eigenvectors of graph-adjacency matrices.

33. On the adjacency matrix of a block graph.

34. Spectral characterization of line graphs of starlike trees.

35. Minimal configuration bicyclic graphs.

36. Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices.

37. On regular graphs and coronas whose second largest eigenvalue does not exceed 1.

38. A note about cospectral graphs for the adjacency and normalized Laplacian matrices.

39. Transferring progress control policies in scheduling problems for a class of repetitive discrete event systems.

40. On the hierarchical product of graphs and the generalized binomial tree.

41. Minimal configuration unicyclic graphs.

42. The polynomial reconstruction of unicyclic graphs is unique.

43. On nonsingular trees and a reciprocal eigenvalue property.

44. Minimal configuration trees.

45. Retarded regular graphs are regular or semiregular.

Catalog

Books, media, physical & digital resources