scientific article; zbMATH DE number 7410331

From MaRDI portal
Publication:5156419

zbMath1472.92338MaRDI QIDQ5156419

Ágota Drégelyi-Kiss, H. Haghbin, Reza Sharafdini, Tamás Réti

Publication date: 15 October 2021

Full work available at URL: https://match.pmf.kg.ac.rs/electronic_versions/Match79/n2/match79n2_509-524.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

On the Variance-Type Graph Irregularity MeasuresComputing irregularity measures for Sudoku graphOn certain degree-based irregularity indices of some nanotubesOn some degree-based irregularity indices of certain networksThe general Albertson irregularity index of graphsOn irregularity descriptors of derived graphsIrregularity of GraphsUnnamed ItemOn the maximum size of stepwise irregular graphsIrregularity measures for metal-organic networksUnnamed ItemOn irregularity indices and main eigenvalues of graphs and their applicabilityThe σ-Irregularity of Chemical TreesOn arithmetic-geometric and geometric-arithmetic indices of graphsOn the irregularity of \(\pi \)-permutation graphs, Fibonacci cubes, and treesMolecular trees with the sixth, seventh and eighth minimal irregularity valuesIrregularity indices for line graph of Dutch windmill graphMostar index: results and perspectivesInverse Problem for the Forgotten and the Hyper Zagreb Indices of TreesIrregularity measures for benzene ring embedded in P-type surfaceComputation of irregularity indices of certain computer networksOn some properties of graph irregularity indices with a particular regard to the \(\sigma \)-indexGraph irregularity and its measuresStepwise irregular graphsComputing SS index of certain dendrimersUnnamed ItemUnnamed ItemLower bounds on the irregularity of trees and unicyclic graphsOn total irregularity index of trees with given number of segments or branching verticesOn the maximum sigma index of \(k\)-cyclic graphsThe extremal irregularity of connected graphs with given number of pendant vertices




This page was built for publication: