On the generalized spectral characterizations of Eulerian graphs (Q668057): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / 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: On hearing the shape of a drum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllable subsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4478151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can One Hear the Shape of a Drum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Godsil Concerning Controllable Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a family of graphs being determined by their generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spectral characterization of graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple arithmetic criterion for graphs being determined by their generalized spectra / rank
 
Normal rank

Latest revision as of 11:39, 18 July 2024

scientific article
Language Label Description Also known as
English
On the generalized spectral characterizations of Eulerian graphs
scientific article

    Statements

    On the generalized spectral characterizations of Eulerian graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2019
    0 references
    Summary: A graph \(G\) is said to be \textit{determined by its generalized spectra} (DGS for short) if, for any graph \(H\), graphs \(H\) and \(G\) are cospectral with cospectral complements imply that \(H\) is isomorphic to \(G\). In [J. Comb. Theory, Ser. B 122, 438--451 (2017; Zbl 1350.05098)], \textit{W. Wang} gave a simple method for a graph to be DGS. However, the method does not apply to Eulerian graphs. In this paper, we gave a simple method for a large family of Eulerian graphs to be DGS. Numerical experiments are also presented to illustrate the effectiveness of the proposed method.
    0 references
    0 references