137-143
Dominating Sets, Fundamental Cut-Sets, Efficient Algorithms, Independent Sets, Maximum Clique
Dominating Sets, Fundamental Cut-Sets, Efficient Algorithms, Independent Sets, Maximum Clique
Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory
Efficient Algorithms for Determining the Maximum Independent Sets in Graphs
New Algorithms for Minimum Dominating Set in Any Graphs
Journal of New Results in Science
Double Edge-Vertex Domination on Middle and Splitting Graphs of Path and Cycle
Fundamental Journal of Mathematics and Applications
Evolutionary Algorithms for the Unit Commitment Problem
Turkish Journal of Electrical Engineering and Computer Science
FEDERAL ALMANYA ÖRNEĞİNDE ULUSAL VE AB TEMEL HAK KORUMASININ UYUMLU BERABERLİĞİ
Türkiye Adalet Akademisi Dergisi
Clique polynomials of $2$-connected $K_{5}$-free chordal graphs
Journal of Algebra Combinatorics Discrete Structures and Applications