16 results on '"Adjacency matrix"'
Search Results
2. Spectral clustering of combinatorial fullerene isomers based on their facet graph structure.
3. The Discrete Laplacian Acting on 2-Forms and Application.
4. The graphs with all but two eigenvalues equal to $$-2$$ or 0.
5. Structure Indicators for Transportation Graph Analysis I: Planar Connected Simple Graphs.
6. The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges.
7. Lower bounds on the (Laplacian) spectral radius of weighted graphs.
8. The Least Eigenvalue of Graphs with Cut Edges.
9. ANHATTAN PRODUCTS OF DIGRAPHS: CHARACTERISTIC POLYNOMIALS AND EXAMPLES.
10. Associative version of the Ramalingam algorithm for dynamically updating the shortest-path subgraph after inserting a new edge into a graph.
11. Maximum Flow in Directed Planar Graphs with Vertex Capacities.
12. Eigenvalues and diameter.
13. On terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph.
14. Unboundedness of Adjacency Matrices of Locally Finite Graphs.
15. On automorphisms of a generalized octagon of order (2, 4).
16. Weakly Cospectral Graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.