Resistance distances in generalized join graphs
From MaRDI portal
Publication:6657258
DOI10.1016/j.dam.2024.11.013MaRDI QIDQ6657258
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resistance distance in complete \(n\)-partite graphs
- Resistance distances and Kirchhoff index of graphs with an involution
- Determinant identities for Laplace matrices
- Resistance between two vertices of almost complete bipartite graphs
- Enumerative properties of Ferrers graphs
- Resistance distance of blowups of trees
- The enumeration of spanning tree of weighted graphs
- Counting spanning trees in almost complete multipartite graphs
- A type of generalized mesh-star transformation and applications in electrical networks
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- Effective resistances and spanning trees in the complete bipartite graph plus a matching
- Resistance distances in vertex-weighted complete multipartite graphs
- Linear algebraic techniques for weighted spanning tree enumeration
- Enumeration of spanning trees of graphs with rotational symmetry
- A simple formula for the number of spanning trees of line graphs
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
- Counting spanning trees with a Kekulé structure in linear hexagonal chains
- Counting spanning trees of \((1, N\))-periodic graphs
- Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
This page was built for publication: Resistance distances in generalized join graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657258)
