Skip to main content

Fuzzy Clique Set Determination Method as an Example of Fuzzy Temporal Graph Invariant

  • Conference paper
  • First Online:
14th International Conference on Theory and Application of Fuzzy Systems and Soft Computing – ICAFS-2020 (ICAFS 2020)

Abstract

The paper investigates the problem of the invariant determination in graphs that have fuzzy-estimated parameters and temporal characteristics. The basic idea is to find fuzzy clique set in such graphs. Fuzzy temporal graph capture the notion of temporal characteristics and uncertainty while processing some operations on it. In this paper the idea of temporality in such graph models is treated in the way that adjacency of the vertices may change over time periods. Cliques normally refer to subgraphs in a graph such that vertices in each subgraph are pairwise adjacent. Adjacency may be uncertain due to some features of the network and may vary in time. In the problem of maximum clique determination the idea is to search the clique with most vertices within a graph. So the fuzzy adjacency here can be interpreted in terms of immediate likelihood of vertex to capture or to share whatever is flowing though the graph network. The idea of maximum clique subset for the fuzzy graph with fuzzy-estimated characteristics is presented in this paper. A method for determination of all maximum clique sets is proposed, as well as a fuzzy clique set is determined. The illustrative examples are given as well.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ore, O.: Theory of graphs. Amer. Math. Soc. Colloq. Publ. Providence (1962)

    Google Scholar 

  2. Kaufmann, A.: Introduction a la theorie des sous-ensemles flous. Masson, Paris (1977)

    Google Scholar 

  3. Christofides, N.: Graph Theory. An Algorithmic Approach. Academic Press, London (1976)

    Google Scholar 

  4. Rosenfeld, A.: Fuzzy graphs. In: Zadeh, L.A., Fu, K.S., Shimura, M. (eds.) Fuzzy Sets and Their Applications, pp. 77–95. Academic Press, New York (1975). https://doi.org/10.1016/B978-0-12-775260-0.50008-6

  5. Monderson, J., Nair, P.: Fuzzy Graphs and Fuzzy Hypergraphs. Physica-Verl, Heidelberg (2000)

    Google Scholar 

  6. Mordeson, J.N., Peng, C.S.: Operations on fuzzy graphs. Inf. Sci. 79, 159–170 (1994)

    Article  MathSciNet  Google Scholar 

  7. Kostakos, V.: Temporal graphs. In: Proceedings of Physica A: Statistical Mechanics and its Applications, vol. 388, no. 6, pp. 1007–1023. Elsevier (2008). https://doi.org/10.1016/j.physa.2008.11.021

  8. Brézillon, P., Pasquier, L., Pomerol, J.-C.: Reasoning with contextual graphs. Eur. J. Oper. Res. 136(2), 290–298 (2002). https://doi.org/10.1016/S0377-2217(01)00116-3

    Article  MATH  Google Scholar 

  9. Barzilay, R., Elhadad, N., McKeown, K.: Inferring strategies for sentence ordering in multidocument news summarization. J. Artif. Intell. Res. 17, 35–55 (2002). https://doi.org/10.1613/jair.991

    Article  MATH  Google Scholar 

  10. Bramsen, P.J.: Doing Time: Inducing Temporal Graphs. Technical report, Massachusetts Institute of Technology (2006)

    Google Scholar 

  11. Baldan, P., Corradini, A., Konig, B.: Verifying finite-state graph grammars: an unfolding-based approach. Lecture Notes in Computer Science, vol. 3170, pp. 83–98 (2004). https://doi.org/10.1007/978-3-540-28644-8_6

  12. Baldan, P., Corradini, A., Konig, B., Konig, B.: Verifying a behavioural logic for graph transformation systems. Electron. Notes Theor. Comput. Sci. 104, 5–24 (2004). https://doi.org/10.1016/j.entcs.2004.08.018

    Article  MATH  Google Scholar 

  13. Collberg, C., Kobourov, S., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: Proceedings of ACM Symposium on Software Visualization (SoftVis 2003), San Diego, CA, USA, pp. 77–86 (2003). https://doi.org/10.1145/774841.774844

  14. Dittmann, F., Bobda, C.: Temporal graph placement on mesh-based coarse grain reconfigurable systems using the spectral method. In: IFIP Advances in Information and Communication Technology, vol. 184, pp. 301–310. Springer (2005). https://doi.org/10.1007/11523277_29

  15. Lu, C., Yu, J.X., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. Proc. VLDB Endow. 10(11), 1538–1549 (2017). https://doi.org/10.14778/3137628.3137660

    Article  Google Scholar 

  16. Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. ACM Trans. Database Syst. 36(4), 21 (2011). https://doi.org/10.1145/2043652.2043654

    Article  Google Scholar 

  17. Li, R.-H., Dai, Q., Wang, G., Ming, Z., Qin, L., Yu, J.X.: Improved algorithms for maximal clique search in uncertain networks. In: Proceedings of IEEE 35th International Conference on Data Engineering (ICDE), Macau, China, pp. 1178–1189 (2019). https://doi.org/10.1109/icde.2019.00108

  18. Bozhenyuk, A., Belyakov, S., Knyazeva, M., Rozenberg, I.: Searching method of fuzzy internal stable set as fuzzy temporal graph invariant. In: Communications in Computer and Information Science, vol. 583, pp. 501–510 (2018). https://doi.org/10.1007/978-3-319-91473-2_43

  19. Bozhenyuk, A., Belyakov, S., Rozenberg, I.: Coloring method of fuzzy temporal graph with the greatest separation degree. In: Advances in Intelligent Systems and Computing, vol. 450, pp. 331–338 (2016). https://doi.org/10.1007/978-3-319-33609-1_30

  20. Bozhenyuk, A., Belyakov, S., Knyazeva, M.: Modeling objects and processes in gis by fuzzy temporal graphs. In: Studies in Fuzziness and Soft Computing, vol. 393, pp. 277–286. (2020). https://doi.org/10.1007/978-3-030-47124-8_22

  21. Bershtein, L., Bozhenyuk, A., Knyazeva, M.: Definition of cliques fuzzy set and estimation of fuzzy graphs isomorphism. Procedia Comput. Sci. 77, 3–10 (2015). https://doi.org/10.1016/j.procs.2015.12.353

    Article  Google Scholar 

  22. Bershtein, L., Bozhenuk, A.: Maghout method for determination of fuzzy independent, dominating vertex sets and fuzzy graph kernels. Int. J. Gener. Syst. 30(1), 45–52 (2001). https://doi.org/10.1080/03081070108960697

    Article  MATH  Google Scholar 

  23. Bozhenyuk, A., Belyakov, S., Kacprzyk, J., Knyazeva, M.: The method of finding the base set of intuitionistic fuzzy graph. In: Advances in Intelligent Systems and Computing, vol. 1197, pp. 18–25 (2020). https://doi.org/10.1007/978-3-030-51156-2_3

Download references

Acknowledgments

The reported study was funded by RFBR according to the research project N 20-01-00197.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Bozhenyuk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bozhenyuk, A., Bozheniuk, V., Kacprzyk, J., Knyazeva, M. (2021). Fuzzy Clique Set Determination Method as an Example of Fuzzy Temporal Graph Invariant. In: Aliev, R.A., Kacprzyk, J., Pedrycz, W., Jamshidi, M., Babanli, M., Sadikoglu, F.M. (eds) 14th International Conference on Theory and Application of Fuzzy Systems and Soft Computing – ICAFS-2020 . ICAFS 2020. Advances in Intelligent Systems and Computing, vol 1306. Springer, Cham. https://doi.org/10.1007/978-3-030-64058-3_1

Download citation

Publish with us

Policies and ethics