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

DOI10.1016/J.AMC.2016.02.021zbMATH Open1410.05206OpenAlexW2290282537MaRDI QIDQ1733396FDOQ1733396

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

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

zbMATH Keywords

graphtreepolynomial algorithmedge-neighbor-scattering number

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)

Cites Work

• Graph theory with applications
• Extremality of degree-based graph entropies
• Maximal matching energy of tricyclic graphs
• Note on two generalizations of the Randić index
• Title not available (Why is that?)
• Neighbour-connectivity in regular graphs
• Edge-neighbor-scattering number of graphs
• Vertex-neighbor-scattering number of graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Vertex-neighbor-scattering number of trees
• Edge-neighbor-scattering number of graphs
• A polynomial algorithm for deciding the validity of an electrical distribution tree
• A polynomial algorithm for weighted scattering number in interval 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)