Network majority on tree topological network

DOI10.1016/j.endm.2016.09.015zbMath1356.05141OpenAlexW2535402894MaRDI QIDQ510545

Shinya Fujita, Yannis Manoussakis, Tadashi Sakuma, Yasuko Matsui, Sylvain Legay, Zsolt Tuza, Ravindra B. Bapat

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.015

zbMATH Keywords

proper central subgraphsweighted safe set

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (10)

Safe sets in graphs: graph classes and structural parameters ⋮ Approximating connected safe sets in weighted trees ⋮ Constructive-destructive heuristics for the safe set problem ⋮ On the weighted safe set problem on paths and cycles ⋮ Safe Sets in Graphs: Graph Classes and Structural Parameters ⋮ Models and algorithms for the weighted safe set problem ⋮ A combinatorial branch and bound for the safe set problem ⋮ A compact mixed integer linear formulation for safe set problems ⋮ Network majority on tree topological network ⋮ A new formulation for the safe set problem on graphs

Cites Work

• A note on two problems in connexion with graphs
• Network majority on tree topological network
• On the range of possible integrities of graphs \(G(n, k)\)
• On the computational complexity of vertex integrity and component order connectivity
• A survey of integrity
• The integrity of a cubic graph
• Finding the k Shortest Paths
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs

This page was built for publication: Network majority on tree topological network