Graph homomorphisms and nodal domains (Q852625): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4217283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph homomorphisms through random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete nodal domain theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perron-Frobenius type results and discrete versions of nodal domain theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and the 2-rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A domain monotonicity theorem for graphs and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358811 / rank
 
Normal rank

Latest revision as of 22:59, 24 June 2024

scientific article
Language Label Description Also known as
English
Graph homomorphisms and nodal domains
scientific article

    Statements