Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.dam.2015.09.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2196040647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lollipop graph is determined by its spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterizations of almost complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complement of the path is determined by its spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterizations of lollipop graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3643746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral characterization of \(\infty\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterizing properties of the permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing properties of permanental polynomials of lollipop graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Laplacian spectral characterization of graphs of index less than 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the spectral characterization of \(\theta \)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5299380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Matrix Functions and the Graph Isomorphism Problem / 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: Developments on spectral characterizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the spectral characterization of dumbbell graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Per-spectral characterizations of graphs with extremal per-nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the permanental polynomials of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Per-spectral characterizations of some edge-deleted subgraphs of a complete graph / rank
 
Normal rank

Latest revision as of 16:07, 11 July 2024

scientific article
Language Label Description Also known as
English
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
scientific article

    Statements

    Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (English)
    0 references
    0 references
    0 references
    18 March 2016
    0 references
    characteristic polynomial
    0 references
    permanental polynomial
    0 references
    cospectral
    0 references
    permanental spectrum
    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