1 citations · 1 across the 4 of their papers we have counts for
4 papers
Generation of weighted trees, block trees and block graphs
Tınaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik
We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and c…
Constructing extremal triangle-free graphs using integer programming
Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın
The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a n…
Maximum size of a triangle-free graph with bounded maximum degree and matching number
Milad Ahanjideh, Tınaz Ekim, Mehmet Akif Yıldız
Determining the maximum number of edges under degree and matching number constraints have been solved for general graphs by Chvátal and Hanson (1976), and by Balachandran and Khare…
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…