Maximum values of sombor index of bicyclic graphs with a given matching number (Q6186542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Graphs with Minimum Sombor Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values on the Sombor index of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values of the Sombor index in unicyclic and bicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sombor index of trees with at most three branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced Sombor index of bicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with integer Sombor indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5012975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5013020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sombor index: review of extremal results and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875218 / rank
 
Normal rank

Latest revision as of 11:29, 26 August 2024

scientific article; zbMATH DE number 7799057
Language Label Description Also known as
English
Maximum values of sombor index of bicyclic graphs with a given matching number
scientific article; zbMATH DE number 7799057

    Statements

    Maximum values of sombor index of bicyclic graphs with a given matching number (English)
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    match number
    0 references
    bicyclic graphs
    0 references
    Sombor index
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references