On the resistance matrix of a graph (Q259168): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2059170
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zhong-Yu Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture about the Szeged index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Laplacians for the distance matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities for minors of the Laplacian, resistance and distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential Theory on Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and electrical resistances in products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance in subdivision-vertex join and subdivision-edge join of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance and the normalized Laplacian spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with constant \(\mu\) and \(\overline{\mu}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix polynomials of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverse of the Laplacian matrix and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On electric resistances for distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5407358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on resistance distances and resistance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance-based graph invariants of subdivisions and triangulations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some rules on resistance distance with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On resistance-distance and Kirchhoff index / rank
 
Normal rank

Latest revision as of 14:23, 11 July 2024

scientific article
Language Label Description Also known as
English
On the resistance matrix of a graph
scientific article

    Statements

    On the resistance matrix of a graph (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2016
    0 references
    Summary: Let \(G\) be a connected graph of order \(n\). The resistance matrix of \(G\) is defined as \(R_G=(r_{ij}(G))_{n\times n}\), where \(r_{ij}(G)\) is the resistance distance between two vertices \(i\) and \(j\) in \(G\). Eigenvalues of \(R_G\) are called R-eigenvalues of \(G\). If all row sums of \(R_G\) are equal, then \(G\) is called resistance-regular. For any connected graph \(G\), we show that \(R_G\) determines the structure of \(G\) up to isomorphism. Moreover, the structure of \(G\) or the number of spanning trees of \(G\) is determined by partial entries of \(R_G\) under certain conditions. We give some characterizations of resistance-regular graphs and graphs with few distinct R-eigenvalues. For a connected regular graph \(G\) with diameter at least \(2\), we show that \(G\) is strongly regular if and only if there exist \(c_1,c_2\) such that \(r_{ij}(G)=c_1\) for any adjacent vertices \(i,j\in V(G)\), and \(r_{ij}(G)=c_2\) for any non-adjacent vertices \(i,j\in V(G)\).
    0 references
    resistance distance
    0 references
    resistance matrix
    0 references
    Laplacian matrix
    0 references
    resistance-regular graph
    0 references
    R-eigenvalue
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references