Abstract
Let G be a graph, and let w be a non-negative real-valued weight function on V(G). For every subset X of V(G), let \(w(X)=\sum _{v \in X} w(v).\) A non-empty subset \(S \subset V(G)\) is a weighted safe set of (G, w) if for every component C of the subgraph induced by S and every component D of \(G-S\), we have \(w(C) \ge w(D)\) whenever there is an edge between C and D. If the subgraph of G induced by a weighted safe set S is connected, then the set S is called a connected weighted safe set of (G, w). The weighted safe number \(\mathrm {s}(G,w)\) and connected weighted safe number \(\mathrm {cs}(G,w)\) of (G, w) are the minimum weights w(S) among all weighted safe sets and all connected weighted safe sets of (G, w), respectively. It is easy to see that for every pair (G, w), \(\mathrm {s}(G,w) \le \mathrm {cs}(G,w)\) by their definitions. In [Journal of Combinatorial Optimization, 37:685–701, 2019], the authors asked which pair (G, w) satisfies the equality \(\mathrm {s}(G,w)=\mathrm {cs}(G,w)\) and it was shown that every weighted cycle satisfies the equality. In the companion paper [European Journal of Combinatorics, in press] of this paper, we give a complete list of connected bipartite graphs G such that \(\mathrm {s}(G,w)=\mathrm {cs}(G,w)\) for every weight function w on V(G). In this paper, as is announced in the companion paper, we show that, for any graph G in this list and for any weight function w on V(G), there exists an FPTAS for calculating a minimum connected safe set of (G, w). In order to prove this result, we also prove that for any tree T and for any weight function \(w^{\prime }\) on V(T), there exists an FPTAS for calculating a minimum connected safe set of \((T,w^{\prime })\). This gives a complete answer to a question posed by Bapat et al. [Networks, 71:82–92, 2018] and disproves a conjecture by Ehard and Rautenbach [Discrete Applied Mathematics, 281:216–223, 2020]. We also show that determining whether a graph is in the above list or not can be done in linear time.
Supported by grant fundings from JSPS KAKENHI (No. 19K03603), National Research Foundation of Korea (NRF-2018R1C1B6003577), and JSPS KAKENHI (No. 26400185, No. 16K05260 and No. 18K03388).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Águeda, R., et al.: Safe sets in graphs: graph classes and structural parameters. J. Comb. Optim. 36(4), 1221–1242 (2017). https://doi.org/10.1007/s10878-017-0205-2
Atici, M., Ernst, C.: On the range of possible integrities of graphs \(g(n, k)\). Graphs Comb. 27, 475–485 (2011). https://doi.org/10.1007/s00373-010-0990-1
Bagga, K.S., Beineke, L.W., Goddard, W.D., Lipman, M.J., Pippert, R.E.: A survey of integrity. Discrete Appl. Math. 37(38), 13–28 (1992)
Bapat, R.B., et al.: Weighted safe set problem on trees. Networks 71, 81–92 (2018)
Belmonte, R., Hanaka, T., Katsikarelis, I., Lampis, M., Ono, H., Otachi, Y.: Parameterized complexity of safe set. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 38–49. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17402-6_4
Benko, D., Ernst, C., Lanphier, D.: Asymptotic bounds on the integrity of graphs and separator theorems for graphs. SIAM J. Discrete Math. 23, 265–277 (2009)
Chartrand, G., Lesniak, L., Zhang, P.: Graphs and Digraphs, 5th edn. Chapman and Hall, London (2011)
Ehard, S., Rautenbach, D.: Approximating connected safe sets in weighted trees. Discrete Appl. Math. 281, 216–223 (2020)
Fujita, S., Furuya, M.: Safe number and integrity of graphs. Discrete Appl. Math. 247, 398–406 (2018)
Fujita, S., Jensen, T., Park, B., Sakuma, T.: On weighted safe set problem on paths and cycles. J. Comb. Optim. 37, 685–701 (2019). https://doi.org/10.1007/s10878-018-0316-4
Fujita, S., MacGillivray, G., Sakuma, T.: Safe set problem on graphs. Discrete Appl. Math. 215, 106–111 (2016)
Fujita, S., Park, B., Sakuma, T.: Stable structure on safe set problems in vertex-weighted graphs. Eur. J. Comb. 103211 (2020). A preprint version. arXiv:1909.02718
Kang, B., Kim, S.-R., Park, B.: On the safe sets of Cartesian product of two complete graphs. Ars Comb. 141, 243–257 (2018)
Kumabe, S., Maehara, T., Sin’ya, R.: Linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem. In: Das, G.K., Mandal, P.S., Mukhopadhyaya, K., Nakano, S. (eds.) WALCOM 2019. LNCS, vol. 11355, pp. 248–260. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-10564-8_20
Vince, A.: The integrity of a cubic graph. Discrete Appl. Math. 140, 223–239 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Fujita, S., Park, B., Sakuma, T. (2020). Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II –Recognition and Complexity–. In: Adler, I., Müller, H. (eds) Graph-Theoretic Concepts in Computer Science. WG 2020. Lecture Notes in Computer Science(), vol 12301. Springer, Cham. https://doi.org/10.1007/978-3-030-60440-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-60440-0_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60439-4
Online ISBN: 978-3-030-60440-0
eBook Packages: Computer ScienceComputer Science (R0)