Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ramin Javadi"'
Autor:
Ramin Javadi, Meysam Miralaei
Publikováno v:
پژوهشهای ریاضی, Vol 7, Iss 3, Pp 485-494 (2021)
The size-Ramsey number of a graph denoted by is the smallest integer such that there is a graph with edges with this property that for any coloring of the edges of with colors, contains a monochromatic copy of. The investigation of the size-Ramsey nu
Externí odkaz:
https://doaj.org/article/4a6124a8cde6458a88440a1bc6d29512
Autor:
Ramin Javadi, Farideh Khoeini
Publikováno v:
Transactions on Combinatorics, Vol 8, Iss 2, Pp 45-51 (2019)
Given a graph $ G $, a graph $ F $ is said to be Ramsey for $ G $ if in every edge coloring of $F$ with two colors, there exists a monochromatic copy of $G$. The minimum number of edges of a graph $ F $ which is Ramsey for $ G $ is called the size-Ra
Externí odkaz:
https://doaj.org/article/4eb5dec16a264aee9c8163147cc5b6e4
Autor:
Sahab Hajebi, Ramin Javadi
Publikováno v:
Theoretical Computer Science. 958:113862
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an acyclic mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2228fdd57c30a5b508766afd0b93428e
https://doi.org/10.1016/j.tcs.2023.113862
https://doi.org/10.1016/j.tcs.2023.113862
Publikováno v:
Journal of Combinatorial Designs. 28:580-603
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b3da1287ab2d04247b4e57bacb4637e
https://doi.org/10.1002/jcd.21717
https://doi.org/10.1002/jcd.21717
Publikováno v:
Journal of Combinatorial Designs. 26:616-639
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aee844b2b459c16555ff273d96cea43f
https://doi.org/10.1002/jcd.21631
https://doi.org/10.1002/jcd.21631
Publikováno v:
Journal of Graph Theory. 88:507-520
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::878cc9d92abfb3d5cf44f53917032d84
https://doi.org/10.1002/jgt.22226
https://doi.org/10.1002/jgt.22226
Autor:
Ramin Javadi, Amir Nikabadi
We present a parameterized dichotomy for the \textsc{$k$-Sparsest Cut} problem in weighted and unweighted versions. In particular, we show that the weighted \textsc{$k$-Sparsest Cut} problem is NP-hard for every $k\geq 3$ even on graphs with bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::655d02aa22ee438e6fa31d4ec94e4d0e
Publikováno v:
Acta Mathematica Hungarica. 149:82-91
The edge clique cover sum number (resp. edge clique partition sum number) of a graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a collection of complete subgraphs of G, covering (resp. partitionin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bdb5b3deda8d629edda33f7b257cf49
https://doi.org/10.1007/s10474-016-0586-1
https://doi.org/10.1007/s10474-016-0586-1
Publikováno v:
Journal of Graph Theory. 81:92-104
A k-clique covering of a simple graph G is a collection of cliques of G covering all the edges of G such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-clique covering is called the local clique cover number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2d2094eaaec2f6dbf6b4a120df3561a
https://doi.org/10.1002/jgt.21864
https://doi.org/10.1002/jgt.21864
Autor:
Saleh Ashkboos, Ramin Javadi
Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generalization of this problem seeking for $ k $ disjoint subsets of vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::822f36cd49e13df2b45f5dd3603466b8