On the Szeged and Wiener complexities in graphs (Q6130108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128955451, #quickstatements; #temporary_batch_1723680031063
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2024.128532 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4391378113 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128955451 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:40, 15 August 2024

scientific article; zbMATH DE number 7833994
Language Label Description Also known as
English
On the Szeged and Wiener complexities in graphs
scientific article; zbMATH DE number 7833994

    Statements

    On the Szeged and Wiener complexities in graphs (English)
    0 references
    0 references
    0 references
    18 April 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Szeged complexity
    0 references
    Wiener complexity
    0 references
    \(\Theta\)-graph
    0 references
    bicyclic graphs
    0 references
    0 references
    0 references