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

DOI10.1016/J.AMC.2016.02.021MaRDI QIDQ1733396zbMATH OpenOpenAlexFDO

Authors Yong Liu, Zongtian Wei, 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

edge-neighbor-scattering numbergraphpolynomial algorithmtree

Mathematics Subject Classification ID

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

Recommendations

• Vertex-neighbor-scattering number of trees
• Edge-neighbor-scattering number of graphs
• scientific article; zbMATH DE number 731853
• Scattering number in graphs
• Vertex-neighbor-scattering number of bipartite graphs

Cites work

• Edge-neighbor-scattering number of graphs
• Extremality of degree-based graph entropies
• Graph theory with applications
• scientific article; zbMATH DE number 3628999 (Why is no real title available?)
• scientific article; zbMATH DE number 731853 (Why is no real title available?)
• scientific article; zbMATH DE number 1109405 (Why is no real title available?)
• Maximal matching energy of tricyclic graphs
• Neighbour-connectivity in regular graphs
• Note on two generalizations of the Randić index
• Vertex-neighbor-scattering number of graphs.

Cited in

(5)

• A polynomial algorithm for deciding the validity of an electrical distribution tree
• A polynomial algorithm for weighted scattering number in interval graphs
• Vertex-neighbor-scattering number of trees
• Edge-neighbor-scattering number of graphs
• The Size of a Minimum Critically m-Neighbor-Scattered Graph

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

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