On the Szeged and Wiener complexities in graphs

DOI10.1016/J.AMC.2024.128532OpenAlexW4391378113WikidataQ128955451 ScholiaQ128955451MaRDI QIDQ6130108FDOQ6130108

Modjtaba Ghorbani, Zahra Vaziri

Publication date: 18 April 2024

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2024.128532

zbMATH Keywords

bicyclic graphs\(\Theta\)-graphWiener complexitySzeged complexity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

This page was built for publication: On the Szeged and Wiener complexities in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130108)