scientific article; zbMATH DE number 1436000

DOI10.1002/(SICI)1098-2418(200003)16:2%3C131::AID-RSA1%3E3.0.CO;2-3zbMATH Open0944.05060MaRDI QIDQ4948017FDOQ4948017

Authors: Johan Jonasson 

Publication date: 18 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• Graph simplification and matching using commute times
• Commute times for a directed graph using an asymmetric Laplacian
• The algebraic connectivity of lollipop graphs
• The line graphs of lollipop graphs are determined by their spectra
• The lollipop graph is determined by its \(Q\)-spectrum
• Spectral characterizations of lollipop graphs
• Algebraic connectivity of lollipop graphs: a new approach
• Comments to ``The line graphs of lollipop graphs are determined by their spectra
• scientific article; zbMATH DE number 1947425

zbMATH Keywords

random walklollipop graphclique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial probability (60C05)

Cited In (5)

• The evolution of the cover time
• Chromatic posets
• Stability and domination exponentially in some graphs
• Numerically efficient \(H_\infty\) analysis of cooperative multi-agent systems
• Lollipop and lariat symmetric functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948017)