نرگس غرقانی

1. Generalized Gapped k-mer Filters for Robust Frequency Estimation

Mohammad Nouri Morteza، Ghareghani Narges، Ghandi Mahmoud (2024)., Bulletin of the Iranian Mathematical Society, 50(5).

2. Extremal digraphs for open neighbourhood location-domination and identifying codes

Foucaud Florent، Ghareghani Narges، شریفانی پویه (2024)., DISCRETE APPLIED MATHEMATICS, 347(1), 62-74.

1. Minimum fundamental cycle basis of graphs

Ghareghani Narges (2023)., 8th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 27 October-3 November, Tehran, Iran.

2. Characterizing spanning trees which give a minimum fundamental cycle basis for a special family of graphs

Ghareghani Narges (2023)., 8th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 27 October-3 November, Tehran, Iran.

3. Cycle basis of graphs

Ghareghani Narges (2023)., 8th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 27 October-3 November, Tehran, Iran.

1. Some family of graphs satisfying an extremal identity

Ghareghani Narges (2022)., 7th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 16-17 November, Tehran, Iran.

2. Palindromes of k-bonacci words on infinite alphabet

Ghareghani Narges (2022)., 7th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 16-17 November, Tehran, Iran.

1. Characterizing extremal graphs for open neighbourhood location-domination

Foucaud Florent، Ghareghani Narges، Roshany-tabrizi aida، شریفانی پویه (2021)., DISCRETE APPLIED MATHEMATICS, 302(1), 76-79.

2. A simple basis for the null space of incidence matrix of a graph

Ghareghani Narges (2021)., The First International Conference on Mathematics and its Application, 11-12 August, Ahvaz, Iran.

3. On square factors and critical factors of k-bonacci words on infinite alphabet

Ghareghani Narges، شریفانی پویه (2021)., Theoretical Computer Science, 865(1), 34-43.

1. Some Properties of the $k$-bonacci Words on Infinite Alphabet

Ghareghani Narges، Mohammad Nouri Morteza، شریفانی پویه (2020)., ELECTRONIC JOURNAL OF COMBINATORICS, 27(3), 1-27.

2. 1, k-Domination Number of Lexicographic Products of Graphs

Ghareghani Narges، Peterin Iztok، شریفانی پویه (2020)., Bulletin of the Malaysian Mathematical Sciences Society, 1(1), 1-17.

1. Some properties of standard episturmian words

Ghareghani Narges (2020)., The second national congress on Mathematics and Statistics, Gonbad Kavous University, 20-21 February, Iran.

2. On the fixed point of a special morphism on infinite alphabet

Ghareghani Narges (2020)., The second national congress on Mathematics and Statistics, Gonbad Kavous University, 20-21 February, Iran.

3. Some results on zero-sum 6-flow conjecture

Ghareghani Narges (2020)., The second national congress on Mathematics and Statistics, Gonbad Kavous University, 20-21 February, Iran.

4. A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices

Ghareghani Narges، Peterin Iztok، شریفانی پویه (2020)., Opuscula Mathematica, 40(2), 375-382.

5. Constructing Bipartite graph G with γ[1,k](G) = |V (G)|

Ghareghani Narges، شریفانی پویه (2019)., 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 20-21 November, Tehran, Iran.

6. Graph G with γ[1,k](G) = γ(G)

Ghareghani Narges، Sharifani Pouyeh (2019)., 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 20-21 November, Tehran, Iran.

7. An Algorithm for Computing the [1, k]-domination Number of the Lexicographic Product of Graphs

Ghareghani Narges، شریفانی پویه (2019)., 4th International Conference on Combinatorics, Cryptography, Computer Science and Computing, 20-21 November, Tehran, Iran.

1. When an optimal dominating set with given constraints exists

Etesami Omid، Ghareghani Narges، Habib Michel، Hooshmandasl Mohammadreza، Naserasr Reza، Sharifani Pouyeh (2019)., Theoretical Computer Science, 1(1), 1-12.

2. A generalized non-negative matrix factorization

Ghareghani Narges، Ghandi Mahmod (2018)., 49th Annual Iranian Mathematics Conferece, 23-26 August, Tehran, Iran.

3. A factorization of binary words and its connection to the Cycle Lemma

Ghareghani Narges، Mohammad Nouri Morteza، Ghandi Mahmod (2018)., 49th Annual Iranian Mathematics Conferece, 23-26 August, Tehran, Iran.

4. On [1, k]-domination number of graphs

Ghareghani Narges (2018)., Iranian-Hungarian workshop on Combinatorics, 12-14 May, Isfahan, Iran.

1. An eigendecomposition problem

Ghareghani Narges (2017)., IPMCC2017, 16-18 May, Tehran, Iran.

2. A New Proof of Validity of Bouchet's Conjecture on Eulerian Bidirected Graphs

Ghareghani Narges (2017)., Transactions on Combinatorics, 6(2), 31-35.