Two Laplacians for the distance matrix of a graph (Q389586): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2013.02.030 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6248150 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance matrix
Property / zbMATH Keywords: distance matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
eigenvalues
Property / zbMATH Keywords: eigenvalues / rank
 
Normal rank
Property / zbMATH Keywords
 
Laplacian
Property / zbMATH Keywords: Laplacian / rank
 
Normal rank
Property / zbMATH Keywords
 
signless Laplacian
Property / zbMATH Keywords: signless Laplacian / rank
 
Normal rank
Property / zbMATH Keywords
 
graph
Property / zbMATH Keywords: graph / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q115188509 / rank
 
Normal rank
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.1016/j.laa.2013.02.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031324894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529449 / 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: Drum Shapes and Isospectral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant of the distance matrix of a tree with matrix weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance matrices and Laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(q\)-analogue of the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cospectral graphs on 12 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction of cospectral graphs for the normalized Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of obtaining a distance-balanced graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for the signless laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a spectral theory of graphs based on the signless Laplacian, I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a spectral theory of graphs based on the signless Laplacian. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a spectral theory of graphs based on the signless Laplacian, III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isospectral graphs and isoperimetric constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing cospectral graphs / 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: Enumeration of cospectral graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of isospectral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on cospectral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large families of laplacian isospectral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance spectrum of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4661931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isospectral Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cospectral graphs and the generalized adjacency matrix / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2013.02.030 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 9 December 2024

scientific article
Language Label Description Also known as
English
Two Laplacians for the distance matrix of a graph
scientific article

    Statements

    Two Laplacians for the distance matrix of a graph (English)
    0 references
    0 references
    0 references
    21 January 2014
    0 references
    distance matrix
    0 references
    eigenvalues
    0 references
    Laplacian
    0 references
    signless Laplacian
    0 references
    graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers