A polynomial algorithm of edge-neighbor-scattering number of trees

DOI10.1016/j.amc.2016.02.021zbMath1410.05206OpenAlexW2290282537MaRDI QIDQ1733396

Zongtian Wei, Yong Liu, Jiarong Shi, Anchan Mai

Publication date: 21 March 2019

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

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

zbMATH Keywords

treegraphpolynomial algorithmedge-neighbor-scattering number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremality of degree-based graph entropies
• Neighbour-connectivity in regular graphs
• Note on two generalizations of the Randić index
• The Maximal Matching Energy of Tricyclic Graphs

This page was built for publication: A polynomial algorithm of edge-neighbor-scattering number of trees