@article{(Open Science Index):https://publications.waset.org/pdf/10007960, title = {Generalized Rough Sets Applied to Graphs Related to Urban Problems}, author = {Mihai Rebenciuc and Simona Mihaela Bibic}, country = {}, institution = {}, abstract = {Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper.}, journal = {International Journal of Mathematical and Computational Sciences}, volume = {11}, number = {9}, year = {2017}, pages = {411 - 416}, ee = {https://publications.waset.org/pdf/10007960}, url = {https://publications.waset.org/vol/129}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 129, 2017}, }