On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs (Q4542164): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03081080290011692 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066639978 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57974537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth, valency, and excess / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, covering index, covering radius and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, eigenspaces and distances to subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of polynomials and its relation with the spectra and diameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating polynomials and their relation with the spectra and conditional diameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From regular boundary graphs to antipodal distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally pseudo-distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local adjacency polynomials to locally pseudo-distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of pseudo-distance-regularity around a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral diameter estimates for \(k\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234142 / rank
 
Normal rank

Latest revision as of 11:19, 4 June 2024

scientific article; zbMATH DE number 1775038
Language Label Description Also known as
English
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
scientific article; zbMATH DE number 1775038

    Statements

    On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs (English)
    0 references
    2 April 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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