See All News
Zhora Nikoghosyan
Position: Senior Scientific Researcher

Phone: (+374 93) 508819
E-mail: zhora@ipia.sci.am




  Titles, Degree

Ph.D. in Mathematical Cybernetics, Minsk Institute of Mathematics, Byeloruss Academy of Sciences, Thesis: “On two generalizations of hamiltonian problem in graph theory”

 
  Education

M.Sc.   Yerevan State University, Department of Applied  Mathematics
 
  Professional Experience

Senior Scientific Researcher   Institute for Informatics and Automation Problems of NAS RA,(1999 – present)

Lecturer   Gyumri Information Technologies Center
(2005-2011)

Senior Lecturer   Institute for Raising the Qualification
of Teachers, (1989 – 1993)

Scientific Researcher   Institute for Informatics and Automation
Problems of NAS RA, (1974 – 1989)
 
  Research Interests

Discrete Mathematics, Graph Theory and Combinatorics. Existence problems of long (large) cycles and paths in graphs, as well as spanning trees in graphs with few end vertices (leaves) and few branch vertices - in forms of various generalizations and improvements of classical results based on minimum degree, connectivity, toughness, forbidden subgraphs and outside structures.

 
  Selected Publications
Zh. Nikoghosyan, On maximal cycle of a graph (Russian), DAN Arm. SSR, v. LXXII, No. 2 (1981) 82-87.

R. Häggkvist and G.G. Nicoghossian, A remark on hamiltonian cycles, J. Combin. Theory Ser. B 30 (1981) 118-120.

Zh. Nikoghosyan, Spanning trees on simple 3-polytopes (Russian), Kybernetika, No. 4 (1982) 35-42.

Zh. Nikoghosyan, n-spanning and hypo-n-spanning graphs (Russian), tanulmanyok, No. 135, Budapest (1982) 153-167.

Zh. Nikoghosyan, On maximal cycles of a graph (Russian), Studia Scientiarum Mathematicarum Hungarica 17 (1982) 251-282.

Zh. Nikoghosyan, A sufficient condition for a graph to be hamiltonian (Russian), DAN Arm. SSR, v. LXXVIII, No. 1 (1984) 12-16.

Zh. Nikoghosyan, An hamiltonian sufficient condition of a graph (Russian), Matematicheskie voprosy kibernetiki i vychislitelnoj tekhniki, v. XIV (1985) 34-54.

Zh. Nikoghosyan, On longest cycles in graphs (Russian), DAN Arm. SSR, v. LXXXI, No. 4 (1985) 166-170.

Zh.G. Nikoghosyan, Path-Extensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 19 (1998) 25-31.

Zh,G. Nikoghosyan, Cycle-Extensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 21 (2000) 121-128.

Zh.G. Nikoghosyan, Cycle-Extensions and Long Cycles in k-connected Graphs, Mathematical Problems of  Computer Science 21 (2000) 129-155.

Zh.G. Nikoghosyan, Discrete Mathematics (Armenian), Gyumri Information Technologies Center (2007) 334 p.

Zh.G. Nikoghosyan, Dirac-type generalizations concerning large cycles in graphs, Discrete Mathematics 309 (2009) 1925-1930, doi: 10.1016/j.disc.2008.03.011.

M.Zh. Nikoghosyan, Zh.G. Nikoghosyan, Large cycles in 4-connected graphs, Discrete Math. 311 (2011) 302-306. doi:10.1016/j.disc.2010.10.020.

Zh.G. Nikoghosyan, “Graph Invariants and Large Cycles: A Survey”, International Journal of Mathematics and Mathematical Sciences, vol. 2011, Article ID 206404, 11 pages, 2011. doi:10.1155/2011/206404. 

Zh.G. Nikoghosyan, Pure Links Between Graph Invariants and Large Cycle Structures, New Frontiers in Graph Theory, Dr. Yagang Zhang (Ed.) (2012) 19-42, ISBN: 978-953-51-0115-4, InTech,  Available from: http://www.intechopen.com/books/new-frontiers-in-graph-theory/pure-links-between-graph-invariants-and-large-cycle-structures-

Zh.G. Nikoghosyan, Two Sufficient Conditions for Hamilton and Dominating Cycles, International Journal of Mathematics and Mathematical Sciences, Article in Press, v. 2012, ID 185346, 25p. DOI: 10.1155/2012/185346.

Zh.G. Nikoghosyan, Disconnected forbidden subgraphs, toughness and Hamilton cycles, ISRN Combinatorics, Volume 2013, Article ID 673971, 4 pages, http://dx.doi.org/10.1155/2013/673971.

Zh.G. Nikoghosyan, Advanced Lower Bounds for the Circumference, Graphs and Combinatorics 29 (2013) 1531-1541. DOI: 10.1007/s00373-012-1209-4. 

 
News



We are pleased to announce that in the frame of the All4R&D project's second open call 26 courses in 6 categories are offered, as well as 4 innovative practices, free of charge. The courses are tailored-made, based on the assessed needs of students and professionals, and trends in the industry. The courses are co-created and are offered in joint collaboration of academic and business organizations from 6 countries (Armenia, Bosnia and Herzegovina, North Macedonia, Germany, Finland, and Austria).

All courses will be in English and employ innovative teaching methods.
Click here for more information.


Open Call for the participation of Young Researchers and Companies in Research projects

We are pleased to announce that the NPUA/IIAP Cooperative R&D Unit has open calls for researchers, MS/Ph.D students, and companies in two new international research projects:
  • Astronomical Objects Classification
  • Performance Optimization System for Hadoop and Spark Frameworks.
We are inviting all the interested parties to participate in these projects.
For more information please follow the link: http://platform.all4rd.net/index.php/2021/02/19/open-call-for-participation-of-young-researchers-and-companies-in-research-projects-3/.



                                                           
CONTACTS
  • 0014, Yerevan, Republic of Armenia, 1, P. Sevak str.
  • Phone: (+37410) 28-20-30
  • Fax: (+37410) 28-20-50
  • E-mail: ipia@ipia.sci.am
ABOUT INSTITUTE
SCIENTIFIC ACTIVITY
EDUCATION