Use of the Szeged index and the revised Szeged index for measuring network bipartivity (Q608277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5787302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bipartite edge frustration of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalues of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contributions of some topological indices and arboreality of molecular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural ordering and branching of acyclic saturated hydrocarbons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800093 / rank
 
Normal rank

Latest revision as of 13:05, 3 July 2024

scientific article
Language Label Description Also known as
English
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
scientific article

    Statements

    Use of the Szeged index and the revised Szeged index for measuring network bipartivity (English)
    0 references
    0 references
    0 references
    25 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Szeged index
    0 references
    revised Szeged index
    0 references
    bipartivity
    0 references
    0 references