Elkin Vumar

According to our database, Elkin Vumar authored at least 25 papers between 2005 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs.

Long Tang, Elkin Vumar

Discuss. Math. Graph Theory, 2020

2019

The extra connectivity of the enhanced hypercubes.

Eminjan Sabir, Aygul Mamut, Elkin Vumar

Theor. Comput. Sci., 2019

The super connectivity of folded crossed cubes.

Xuepeng Cai, Elkin Vumar

Inf. Process. Lett., 2019

On the chromatic number of 2K2-free graphs.

Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar

Discret. Appl. Math., 2019

2018

On upper bounds for the independent transversal domination number.

Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar

Discret. Appl. Math., 2018

2014

Super Edge connectivity of Kronecker Products of graphs.

Xiang-Lan Cao, Elkin Vumar

Int. J. Found. Comput. Sci., 2014

Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph.

Eminjan Sabir, Elkin Vumar

Graphs Comb., 2014

Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs.

Xiaoling Ma, Elkin Vumar

Graphs Comb., 2014

2012

Distance-Dominating Cycles in P3-Dominated Graphs.

Metrose Metsidik, Elkin Vumar

Ars Comb., 2012

The Wiener-type indices of the corona of two graphs.

Hong Bian, Xiaoling Ma, Elkin Vumar, Haizheng Yu

Ars Comb., 2012

2011

On edge connectivity of direct products of graphs.

Xiang-Lan Cao, Spela Brglez, Simon Spacapan, Elkin Vumar

Inf. Process. Lett., 2011

A note on a cycle partition problem.

Fengli Yang, Elkin Vumar

Appl. Math. Lett., 2011

2010

Toughness and Matching Extension in <i>P</i>₃{\mathcal{P}_3}-Dominated Graphs.

Metrose Metsidik, Elkin Vumar

Graphs Comb., 2010

Wiener and vertex PI indices of Kronecker products of graphs.

Marhaba Hoji, Zhaoyang Luo, Elkin Vumar

Discret. Appl. Math., 2010

2009

On hamiltonicity of <i>P</i> ₃-dominated graphs.

Hajo Broersma, Elkin Vumar

Math. Methods Oper. Res., 2009

Circumferences of 2-connected quasi-claw-free graphs.

Aygul Mamut, Sawut Awut, Elkin Vumar

Ars Comb., 2009

A note on the connectivity of Kronecker products of graphs.

Raxida Guji, Elkin Vumar

Appl. Math. Lett., 2009

2008

Vertex vulnerability parameters of Kronecker products of complete graphs.

Aygul Mamut, Elkin Vumar

Inf. Process. Lett., 2008

On the Circumference of 2-Connected <i>P</i>₃\mathcal{P}_{3}-Dominated Graphs.

Jiangyan Guo, Elkin Vumar

Graphs Comb., 2008

Edge vulnerability parameters of bisplit graphs.

Metrose Metsidik, Elkin Vumar

Comput. Math. Appl., 2008

2007

The Vertex-Neighbor-Integrity of Digraphs.

Jiangyan Guo, Elkin Vumar

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

On the Circumference of 3-Connected Quasi-Claw-Free Graphs.

Elkin Vumar

Graphs Comb., 2006

2005

Degree bounds for the circumference of 3-connected graphs.

Heinz Adolf Jung, Elkin Vumar

J. Graph Theory, 2005

Some degree bounds for the circumference of graphs.

Elkin Vumar, Heinz Adolf Jung

Discret. Math., 2005

A Note on the Integrity of Middle Graphs.

Aygul Mamut, Elkin Vumar

Proceedings of the Discrete Geometry, 2005