Graph Algorithms and Graph Theory-Symmetry Special Issue
1. Structural Graph Theory
2. Algorithmic Graph Theory and Applications
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
References
- Rupnik Poklukar, D.; Žerovnik, J. Double Roman Domination in Generalized Petersen Graphs P (ck, k). Symmetry 2022, 14, 1121. [Google Scholar] [CrossRef]
- Muaengwaeng, A.; Boonklurb, R.; Singhun, S. Pancyclicity of the n-Generalized Prism over Skirted Graphs. Symmetry 2022, 14, 816. [Google Scholar] [CrossRef]
- Gomez, L.; Rubi, K.; Terrazas, J.; Narayan, D.A. All Graphs with a Failed Zero Forcing Number of Two. Symmetry 2021, 13, 2221. [Google Scholar] [CrossRef]
- Nichita, F.F. On the Johnson–Tzitzeica Theorem, Graph Theory, and Yang–Baxter Equations. Symmetry 2021, 13, 2070. [Google Scholar] [CrossRef]
- Santra, S.S.; Victor, P.; Chandramouleeswaran, M.; El-Nabulsi, R.A.; Khedher, K.M.; Govindan, V. Connectivity of Semiring Valued Graphs. Symmetry 2021, 13, 1227. [Google Scholar] [CrossRef]
- Lee, C.M. Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. Symmetry 2022, 14, 676. [Google Scholar] [CrossRef]
- Zhang, T.; Du, Q.; Yang, G.; Wang, C.; Chen, C.Y.; Zhang, C.; Chen, S.; Fang, Z. Assembly Configuration Representation and Kinematic Modeling for Modular Reconfigurable Robots Based on Graph Theory. Symmetry 2022, 14, 433. [Google Scholar] [CrossRef]
- Klobučar, A.; Manger, R. Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty. Symmetry 2021, 13, 2259. [Google Scholar] [CrossRef]
- Valdés, L.; Ariza, A.; Allende, S.M.; Triviño, A.; Joya, G. Search of the Shortest Path in a Communication Network with Fuzzy Cost Functions. Symmetry 2021, 13, 1534. [Google Scholar] [CrossRef]
- Rezig, S.; Rezg, N.; Hajej, Z. Online Activation and Deactivation of a Petri Net Supervisor. Symmetry 2021, 13, 2218. [Google Scholar] [CrossRef]
- Barbu, T. Automatic unsupervised texture recognition framework using anisotropic diffusion-based multi-scale analysis and weight-connected graph clustering. Symmetry 2021, 13, 925. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Lafond, M. Graph Algorithms and Graph Theory-Symmetry Special Issue. Symmetry 2022, 14, 1748. https://doi.org/10.3390/sym14081748
Lafond M. Graph Algorithms and Graph Theory-Symmetry Special Issue. Symmetry. 2022; 14(8):1748. https://doi.org/10.3390/sym14081748
Chicago/Turabian StyleLafond, Manuel. 2022. "Graph Algorithms and Graph Theory-Symmetry Special Issue" Symmetry 14, no. 8: 1748. https://doi.org/10.3390/sym14081748
APA StyleLafond, M. (2022). Graph Algorithms and Graph Theory-Symmetry Special Issue. Symmetry, 14(8), 1748. https://doi.org/10.3390/sym14081748