Martin Knor

According to our database, Martin Knor authored at least 81 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Extremizing antiregular graphs by modifying total σ-irregularity.

Martin Knor, Riste Skrekovski, Slobodan Filipovski, Darko Dimitrov

Appl. Math. Comput., 2025

2024

Diameter of nanotori.

Vesna Andova, Pavel Dimovski, Martin Knor, Riste Skrekovski

Appl. Math. Comput., February, 2024

Selected topics on Wiener index.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Ars Math. Contemp., 2024

2023

On maximum Wiener index of directed grids.

Martin Knor, Riste Skrekovski

Art Discret. Appl. Math., March, 2023

2022

A note on the metric and edge metric dimensions of 2-connected graphs.

Martin Knor, Riste Skrekovski, Ismael G. Yero

Discret. Appl. Math., 2022

On 12-regular nut graphs.

Nino Basic, Martin Knor, Riste Skrekovski

Art Discret. Appl. Math., 2022

2021

Domination versus independent domination in regular graphs.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

J. Graph Theory, 2021

Graphs with the edge metric dimension smaller than the metric dimension.

Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero

Appl. Math. Comput., 2021

2020

Remarks on Distance Based Topological Indices for ℓ-Apex Trees.

Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Skrekovski

Symmetry, 2020

The structure of graphs with given number of blocks and the maximum Wiener index.

Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski

J. Comb. Optim., 2020

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs.

Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski

Discret. Appl. Math., 2020

Maximal Wiener index for graphs with prescribed number of blocks.

Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski

Appl. Math. Comput., 2020

Some remarks on Balaban and sum-Balaban index.

Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh

Art Discret. Appl. Math., 2020

2019

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs.

Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski

CoRR, 2019

Unicyclic graphs with the maximal value of Graovac-Pisanski index.

Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh

Ars Math. Contemp., 2019

Trees with the maximal value of Graovac-Pisanski index.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2019

On the minimum distance in a <i>k</i>-vertex set in a graph.

Martin Knor, Riste Skrekovski

Appl. Math. Comput., 2019

An inequality between variable wiener index and variable szeged index.

Katarína Hrináková, Martin Knor, Riste Skrekovski

Appl. Math. Comput., 2019

2018

Graphs preserving total distance upon vertex removal.

Snjezana Majstorovic, Martin Knor, Riste Skrekovski

Electron. Notes Discret. Math., 2018

Graphs whose Wiener index does not change when a specific vertex is removed.

Martin Knor, Snjezana Majstorovic, Riste Skrekovski

Discret. Appl. Math., 2018

Graphs preserving Wiener index upon vertex removal.

Martin Knor, Snjezana Majstorovic, Riste Skrekovski

Appl. Math. Comput., 2018

On a conjecture about the ratio of Wiener index in iterated line graphs.

Martin Knor, Katarína Hrináková, Riste Skrekovski

Art Discret. Appl. Math., 2018

2017

On the minimum value of sum-Balaban index.

Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2017

On the difference between the Szeged and the Wiener index.

Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski

Appl. Math. Comput., 2017

2016

Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10).

Martin Knor, Maryam Verdian-Rizi

Discret. Math., 2016

Orientations of graphs with maximum Wiener index.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Discret. Appl. Math., 2016

Mathematical aspects of Wiener index.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Ars Math. Contemp., 2016

A search for the minimum value of Balaban index.

Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2016

Digraphs with large maximum Wiener index.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2016

Some remarks on Wiener index of oriented graphs.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2016

Dominance in a Cayley digraph and in its reverse.

Martin Knor, Jaromír Sýs

Australas. J Comb., 2016

2015

Sandwiching the (generalized) Randić index.

Martin Knor, Borut Luzar, Riste Skrekovski

Discret. Appl. Math., 2015

An inequality between the edge-Wiener index and the Wiener index of a graph.

Martin Knor, Riste Skrekovski, Aleksandra Tepeh

Appl. Math. Comput., 2015

2014

Smallest Vertex-Transitive Graphs of Given Degree and Diameter.

Martin Knor, Jozef Sirán

J. Graph Theory, 2014

Smallest regular graphs of given degree and diameter.

Martin Knor

Discuss. Math. Graph Theory, 2014

Relationship between the edge-Wiener index and the Gutman index of a graph.

Martin Knor, Primoz Potocnik, Riste Skrekovski

Discret. Appl. Math., 2014

Complete solution of equation W(L³(T))=W(T) for the Wiener index of iterated line graphs of trees.

Martin Knor, Martin Macaj, Primoz Potocnik, Riste Skrekovski

Discret. Appl. Math., 2014

Wiener index of generalized 4-stars and of their quadratic line graphs.

Martin Knor, Riste Skrekovski

Australas. J Comb., 2014

2013

Line graph operation and small worlds.

Jelena Govorcin, Martin Knor, Riste Skrekovski

Inf. Process. Lett., 2013

Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs.

Mike J. Grannell, Martin Knor

Graphs Comb., 2013

Wiener index of iterated line graphs of trees homeomorphic to.

Martin Knor, Primoz Potocnik, Riste Skrekovski

Discret. Math., 2013

Wiener index of iterated line graphs of trees homeomorphic to the claw <i>K</i>_{1, 3}.

Martin Knor, Primoz Potocnik, Riste Skrekovski

Ars Math. Contemp., 2013

A note on 2-subset-regular self-complementary 3-uniform hypergraphs.

Martin Knor, Primoz Potocnik

Ars Comb., 2013

On a variation of the Randíc index.

Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski

Australas. J Comb., 2013

2012

On the number of triangular embeddings of complete graphs and complete tripartite graphs.

Mike J. Grannell, Martin Knor

J. Graph Theory, 2012

Efficient domination in cubic vertex-transitive graphs.

Martin Knor, Primoz Potocnik

Eur. J. Comb., 2012

Hyperbolic analogues of fullerenes on orientable surfaces.

Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski

Discret. Math., 2012

On a conjecture about Wiener index in iterated line graphs of trees.

Martin Knor, Primoz Potocnik, Riste Skrekovski

Discret. Math., 2012

The Wiener index in iterated line graphs.

Martin Knor, Primoz Potocnik, Riste Skrekovski

Discret. Appl. Math., 2012

Biembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs.

Michael John Grannell, Martin Knor

Electron. J. Comb., 2012

Small radial Moore graphs of radius 3.

Martin Knor

Australas. J Comb., 2012

2011

A study of 3-arc graphs.

Martin Knor, Guangjun Xu, Sanming Zhou

Discret. Appl. Math., 2011

A Construction for Biembeddings of Latin Squares.

Mike J. Grannell, Martin Knor

Electron. J. Comb., 2011

Efficient open domination in digraphs.

Ludovít Niepel, Martin Knor

Australas. J Comb., 2011

Biembeddings of Latin squares obtained from a voltage construction.

Mike J. Grannell, Martin Knor

Australas. J Comb., 2011

2010

A lower bound for the number of orientable triangular embeddings of some complete graphs.

Mike J. Grannell, Martin Knor

J. Comb. Theory B, 2010

Diameter and connectivity of 3-arc graphs.

Martin Knor, Sanming Zhou

Discret. Math., 2010

Domination In The Cross Product Of Digraphs.

Ludovít Niepel, Martin Knor

Ars Comb., 2010

2009

Domination in a digraph and in its reverse.

Ludovít Niepel, Martin Knor

Discret. Appl. Math., 2009

On Biembeddings of Latin Squares.

Mike J. Grannell, Terry S. Griggs, Martin Knor

Electron. J. Comb., 2009

Unicyclic radially-maximal graphs on the minimum number of vertices.

Martin Knor

Australas. J Comb., 2009

2008

Regular hamiltonian embeddings of K_{n, n} and regular triangular embeddings of K_{n, n, n}.

Martin Knor, Jozef Sirán

Discret. Math., 2008

A census of the orientable biembeddings of Steiner triple systems of order 15.

Mike J. Grannell, Terry S. Griggs, Martin Knor, A. R. W. Thrower

Australas. J Comb., 2008

2007

Minimal non-selfcentric radially-maximal graphs of radius 4.

Martin Knor

Discuss. Math. Graph Theory, 2007

2006

Iterated line graphs are maximally ordered.

Martin Knor, Ludovít Niepel

J. Graph Theory, 2006

Triangulations of orientable surfaces by complete tripartite graphs.

Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán

Discret. Math., 2006

Linkability in iterated line graphs.

Thomas Böhme, Martin Knor, Ludovít Niepel

Discret. Math., 2006

Distance Independent Domination In Iterated Line Graphs.

Martin Knor, Ludovít Niepel

Ars Comb., 2006

2004

A Steiner triple system which colors all cubic graphs.

Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera

J. Graph Theory, 2004

Independence Number in Path Graphs.

Martin Knor, Ludovít Niepel

Comput. Artif. Intell., 2004

2003

Connectivity of iterated line graphs.

Martin Knor, Ludovít Niepel

Discret. Appl. Math., 2003

2002

Connectivity of path graphs.

Martin Knor, Ludovít Niepel, Maryam Malah

Australas. J Comb., 2002

2001

Diameter in iterated path graphs.

Martin Knor, Ludovít Niepel

Discret. Math., 2001

2000

Connectivity of path graphs.

Martin Knor, Ludovít Niepel

Discuss. Math. Graph Theory, 2000

1997

Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface.

Martin Knor, Jozef Sirán

J. Graph Theory, 1997

1996

A Note on Radially Moore Digraphs.

Martin Knor

IEEE Trans. Computers, 1996

Radii and centers in iterated line digraphs.

Martin Knor, Ludovít Niepel

Discuss. Math. Graph Theory, 1996

Distances in iterated line graphs.

Ludovít Niepel, Martin Knor, Lubomír Soltés

Ars Comb., 1996

Characterization of minor-closed pseudosurfaces.

Martin Knor

Ars Comb., 1996

On Ramsey-type games for graphs.

Martin Knor

Australas. J Comb., 1996

1994

On radially maximal graphs.

Ferdinand Gliviak, Martin Knor, Lubomír Soltés

Australas. J Comb., 1994