Orthogonal polynomials through complex matrix graph theory (Q2679265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Krishnan Balasubramanian / rank
Normal rank
 
Property / author
 
Property / author: Krishnan Balasubramanian / 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.1007/s10910-022-01415-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4307648417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5634000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dendrimer eigen-characteristics / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:01, 31 July 2024

scientific article
Language Label Description Also known as
English
Orthogonal polynomials through complex matrix graph theory
scientific article

    Statements

    Orthogonal polynomials through complex matrix graph theory (English)
    0 references
    19 January 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    orthogonal polynomials
    0 references
    complex matrices
    0 references
    graph theory
    0 references
    matching polynomials
    0 references
    characteristic polynomials
    0 references
    0 references