Social Structure Decomposition With Security Issue

Social structure decomposition has been a valuable research topic in the study of social networks, and it still has many unresolved problems. At the same time, an increasing number of people pays attention to the security issue that is worth considering and researching. With security consideration, we study a new social structure decomposition problem that can be formulated as a minimization problem in graph theory as follows: given a social network with formulation as a graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula>, partition the vertex set of <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> into the minimum number of subsets, such that each subset induces an acyclic graph called a forest. This minimum number is called the vertex arboricity, denoted by <inline-formula> <tex-math notation="LaTeX">$va(G)$ </tex-math></inline-formula>. It is well known that the vertex arboricity <inline-formula> <tex-math notation="LaTeX">$va(G)\leq 3$ </tex-math></inline-formula> for each planar graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> in the graph theory. In this paper, we prove that for the planar graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula>, if no 3-cycle intersects a 4-cycle or no 3-cycle intersects a 5-cycle, then <inline-formula> <tex-math notation="LaTeX">$va(G)\leq 2$ </tex-math></inline-formula>.

[1]  Stefan A. Burr.  An inequality involving the vertex arboricity and edge arboricity of a graph , 1986, J. Graph Theory.

[2]  Weili Wu,et al.  The Maximum Community Partition Problem in Networks , 2013, 2013 International Conference on Social Intelligence and Technology.

[3]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Ko-Wei Lih,et al.  Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles , 2002, SIAM J. Discret. Math..

[5]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Weili Wu,et al.  Terminal-set-enhanced community detection in social networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[7]  Wei-Fan Wang,et al.  Vertex arboricity of planar graphs without chordal 6-cycles , 2013, Int. J. Comput. Math..

[8]  André Raspaud,et al.  On the vertex-arboricity of planar graphs , 2008, Eur. J. Comb..

[9]  Weili Wu,et al.  Size Matters: A Comparative Analysis of Community Detection Algorithms , 2017, IEEE Transactions on Computational Social Systems.

[10]  K. S. Poh.  On the linear vertex-arboricity of a planar graph , 1990, J. Graph Theory.

[11]  Wei-Fan Wang,et al.  On the vertex-arboricity of planar graphs without 7-cycles , 2012, Discret. Math..

[12]  Panos M. Pardalos,et al.  Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.

[13]  Deying Li,et al.  Mutual-Relationship-Based Community Partitioning for Social Networks , 2014, IEEE Transactions on Emerging Topics in Computing.

[14]  J. Friedman.  Greedy function approximation: A gradient boosting machine. , 2001 .

[15]  Gary Chartrand,et al.  The point-arboricity of a graph , 1968 .

[16]  Lin Sun,et al.  Vertex arboricity of planar graphs without intersecting 5-cycles , 2018, J. Comb. Optim..

[17]  Bojan Mohar,et al.  Planar Graphs Without Cycles of Specific Lengths , 2002, Eur. J. Comb..

[18]  Weili Wu,et al.  A nature-inspired influence propagation model for the community expansion problem , 2014, J. Comb. Optim..

[19]  Li Wang,et al.  Noise-tolerance community detection and evolution in dynamic social networks , 2014, J. Comb. Optim..

[20]  Min Chen,et al.  Vertex-arboricity of planar graphs without intersecting triangles , 2012, Eur. J. Comb..

[21]  Ko-Wei Lih,et al.  Choosability and edge choosability of planar graphs without five cycles , 2002, Appl. Math. Lett..

[22]  Susmita Sur-Kolay,et al.  Efficient Algorithms for Vertex Arboricity of Planar Graphs , 1995, FSTTCS.