Abstract
A graph G is called a fractional (g, f, m)-deleted graph if the resulting graph admits a fractional (g, f)-factor after m edges are removed. An important fact in the characterization of a discrete graph dynamical system is played by the independent sets, i.e., subsets of the vertex set of G in which any two of them are not adjacent because they reflect the sparsity and stability of the graph system in somehow. The neighborhoods union of independent sets characterizes the local density and local clustering characteristics of the graph system. In this paper, we study the relationship between characteristics of independent sets and fractional (g, f, m)-deleted graph systems. The main contributions cover two aspects: first, we present an independent set degree condition for a graph to be fractional (g, f, m)-deleted; later an independent set neighborhood union condition for fractional (g, f, m)-deleted graphs is determined. Furthermore, we show that the results obtained are the best in some sense.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ackerman, J., Ayers, K., Beltran, E.J., Bonet, J., Lu, D., Rudelius, T.: A behavioral characterization of discrete time dynamical systems over directed graphs. Qual. Theory Dyn. Syst. 13, 161–180 (2014)
Aledo, J.A., Martinez, S., Valverde, J.C.: Parallel dynamical systems over graphs and related topics: a survey. J. Appl. Math. 2015 (2015) Article ID 594294. doi:10.1155/2015/594294
Bondy, J.A., Mutry, U.S.R.: Graph Theory. Springer, Berlin (2008)
Farahani, M.R., Jamil, M.K., Imran, M.: Vertex \(PI_{v}\) topological index of Titania carbon nanotubes \(TiO_{2}(m, n)\). Appl. Math. Nonlinear Sci. 1, 175–182 (2016)
Gao, W., Farahani, M.R.: Degree-based indices computation for special chemical molecular structures using edge dividing method. Appl. Math. Nonlinear Sci. 1, 99–122 (2016)
Gao, W., Guo, Y., Wang, K.Y.: Ontology algorithm using singular value decomposition and applied in multidisciplinary. Cluster Comput. 19, 2201–2210 (2016)
Gao, W., Liang, L., Xu, T., Zhou, J.: Degree conditions for fractional \((g, f, n^{\prime }, m)\)-critical deleted graphs and fractional ID-\((g, f, m)\)-deleted graphs. Bull. Malays. Math. Sci. Soc. 39, 315–330 (2016)
Gao, W., Wang, W.: The eccentric connectivity polynomial of two classes of nanotubes. Chaos Solitons Fractals 89, 290–294 (2016)
Gao, W., Wang, W.: The fifth geometric arithmetic index of bridge graph and carbon nanocones. J. Differ. Equ. Appl. (2016). doi:10.1080/10236198.2016.1197214
Guirao, J.L.G., Luo, A.C.J.: New trends in nonlinear dynamics and chaoticity. Nonlinear Dyn. 84, 1–2 (2016)
Jin, J.: Multiple solutions of the Kirchhoff-type problem in \(R{N}\). Appl. Math. Nonlinear Sci. 1, 229–238 (2016)
Zhou, S.: A sufficient condition for a graph to be an \((a, b, k)\)-critical graph. J. Comput. Math. 87(10), 2202–2211 (2010)
Zhou, S., Bian, Q.: An existence theorem on fractional deleted graphs. Period. Math. Hung. 71, 125–133 (2015)
Zhou, S., Sun, Z., Xu, Y.: A theorem on fractional ID-\((g, f)\)-factor-critical graphs. Contrib. Discrete Math. 10(2), 31–38 (2015)
Zhou, S., Sun, Z.: On all fractional \((a, b, k)\)-critical graphs. Acta Math. Sin. Engl. Ser. 30(4), 696–702 (2014)
Zhou, S., Wu, J., Pan, Q.: A result on fractional ID-\([a, b]\) -factor-critical graphs. Australas. J. Comb. 58, 172–177 (2014)
Zhou, S., Yang, F., Sun, Z.: A neighborhood condition for fractional ID-[\(a, b\)]-factor-critical graphs. Discuss. Math. Graph Theory 36(2), 409–418 (2016)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gao, W., Guirao, J.L.G. & Wu, H. Two Tight Independent Set Conditions for Fractional (g, f, m)-Deleted Graphs Systems. Qual. Theory Dyn. Syst. 17, 231–243 (2018). https://doi.org/10.1007/s12346-016-0222-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12346-016-0222-z