Affiliated Institutions
Related Publications
Neural Network for Graphs: A Contextual Constructive Approach
This paper presents a new approach for learning in structured domains (SDs) using a constructive neural network for graphs (NN4G). The new model allows the extension of the inpu...
The average distances in random graphs with given expected degrees
Random graph theory is used to examine the “small-world phenomenon”; any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain...
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
We present a new approach for the approximate K-nearest neighbor search based on navigable small world graphs with controllable hierarchy (Hierarchical NSW, HNSW). The proposed ...
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
Graphs over time
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs...
Publication Info
- Year
- 2025
- Type
- article
- Citations
- 0
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
0
OpenAlex
Cite This
Muhammad Shoaib Sardar
(2025).
Analytical Computation of Resistance Distance and Kirchhoff Index for Cyclic Octahedral Graphs.
Circuits Systems and Signal Processing
.
https://doi.org/10.1007/s00034-025-03448-4
Identifiers
- DOI
- 10.1007/s00034-025-03448-4