Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs (Q2192108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Random walks and the effective resistance sum rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance local rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $W$-bases of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5800730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance in complete \(n\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The second moment of the complexity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kirchhoff indices and the matching numbers of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distances and Kirchhoff index of graphs with an involution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Foster's Network Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-point resistances and random walks on stellated regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance between two vertices of almost complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating spanning trees of graphs with an involution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Proof of Foster’s First Theorem / rank
 
Normal rank

Latest revision as of 00:44, 23 July 2024

scientific article
Language Label Description Also known as
English
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
scientific article

    Statements

    Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs (English)
    0 references
    0 references
    29 June 2020
    0 references
    spanning tree
    0 references
    complete bipartite graph
    0 references
    electrical network
    0 references
    effective resistance
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references