Martin Knor - RankMe

85 papers Journal 85

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Invitation to the subpath number. Appl. Math. Comput. Martin Knor, Jelena Sedlar, Riste Skrekovski, Yu Yang
2026	J	`jnl`	The subpath number of cactus graphs. Comput. Appl. Math. Martin Knor, Jelena Sedlar, Riste Skrekovski, Yu Yang
2025	J	`jnl`	Extremizing antiregular graphs by modifying total σ-irregularity. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Slobodan Filipovski, Darko Dimitrov
2025	J	`jnl`	On regular graphs with Šoltés vertices. Ars Math. Contemp. Nino Basic, Martin Knor, Riste Skrekovski
2024	J	`jnl`	Diameter of nanotori. Appl. Math. Comput. Vesna Andova, Pavel Dimovski, Martin Knor, Riste Skrekovski
2024	J	`jnl`	Selected topics on Wiener index. Ars Math. Contemp. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2023	J	`jnl`	On maximum Wiener index of directed grids. Art Discret. Appl. Math. Martin Knor, Riste Skrekovski
2022	J	`jnl`	A note on the metric and edge metric dimensions of 2-connected graphs. Discret. Appl. Math. Martin Knor, Riste Skrekovski, Ismael G. Yero
2022	J	`jnl`	On 12-regular nut graphs. Art Discret. Appl. Math. Nino Basic, Martin Knor, Riste Skrekovski
2021	J	`jnl`	Domination versus independent domination in regular graphs. J. Graph Theory Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2021	J	`jnl`	Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero
2020	J	`jnl`	Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
2020	J	`jnl`	Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2020	J	`jnl`	Remarks on Distance Based Topological Indices for ℓ-Apex Trees. Symmetry Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Skrekovski
2020	J	`jnl`	Some remarks on Balaban and sum-Balaban index. Art Discret. Appl. Math. Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh
2020	J	`jnl`	The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2019	J	`jnl`	An inequality between variable wiener index and variable szeged index. Appl. Math. Comput. Katarína Hrináková, Martin Knor, Riste Skrekovski
2019	J	`jnl`	Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
2019	J	`jnl`	On the minimum distance in a Appl. Math. Comput. Martin Knor, Riste Skrekovski
2019	J	`jnl`	The structure of graphs with given number of blocks and the maximum Wiener index. CoRR Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
2019	J	`jnl`	Trees with the maximal value of Graovac-Pisanski index. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2019	J	`jnl`	Unicyclic graphs with the maximal value of Graovac-Pisanski index. Ars Math. Contemp. Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh
2018	J	`jnl`	Graphs preserving Wiener index upon vertex removal. Appl. Math. Comput. Martin Knor, Snjezana Majstorovic, Riste Skrekovski
2018	J	`jnl`	Graphs preserving total distance upon vertex removal. Electron. Notes Discret. Math. Snjezana Majstorovic, Martin Knor, Riste Skrekovski
2018	J	`jnl`	Graphs whose Wiener index does not change when a specific vertex is removed. Discret. Appl. Math. Martin Knor, Snjezana Majstorovic, Riste Skrekovski
2018	J	`jnl`	On a conjecture about the ratio of Wiener index in iterated line graphs. Art Discret. Appl. Math. Martin Knor, Katarína Hrináková, Riste Skrekovski
2017	J	`jnl`	On the difference between the Szeged and the Wiener index. Appl. Math. Comput. Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
2017	J	`jnl`	On the minimum value of sum-Balaban index. Appl. Math. Comput. Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	A search for the minimum value of Balaban index. Appl. Math. Comput. Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Digraphs with large maximum Wiener index. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Dominance in a Cayley digraph and in its reverse. Australas. J Comb. Martin Knor, Jaromír Sýs
2016	J	`jnl`	Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10). Discret. Math. Martin Knor, Maryam Verdian-Rizi
2016	J	`jnl`	Mathematical aspects of Wiener index. Ars Math. Contemp. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Orientations of graphs with maximum Wiener index. Discret. Appl. Math. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2016	J	`jnl`	Some remarks on Wiener index of oriented graphs. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2015	J	`jnl`	An inequality between the edge-Wiener index and the Wiener index of a graph. Appl. Math. Comput. Martin Knor, Riste Skrekovski, Aleksandra Tepeh
2015	J	`jnl`	Sandwiching the (generalized) Randić index. Discret. Appl. Math. Martin Knor, Borut Luzar, Riste Skrekovski
2014	J	`jnl`	Complete solution of equation W(L Discret. Appl. Math. Martin Knor, Martin Macaj, Primoz Potocnik, Riste Skrekovski
2014	J	`jnl`	Relationship between the edge-Wiener index and the Gutman index of a graph. Discret. Appl. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2014	J	`jnl`	Smallest Vertex-Transitive Graphs of Given Degree and Diameter. J. Graph Theory Martin Knor, Jozef Sirán
2014	J	`jnl`	Smallest regular graphs of given degree and diameter. Discuss. Math. Graph Theory Martin Knor
2014	J	`jnl`	Wiener index of generalized 4-stars and of their quadratic line graphs. Australas. J Comb. Martin Knor, Riste Skrekovski
2013	J	`jnl`	A note on 2-subset-regular self-complementary 3-uniform hypergraphs. Ars Comb. Martin Knor, Primoz Potocnik
2013	J	`jnl`	Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs. Graphs Comb. Mike J. Grannell, Martin Knor
2013	J	`jnl`	Line graph operation and small worlds. Inf. Process. Lett. Jelena Govorcin, Martin Knor, Riste Skrekovski
2013	J	`jnl`	On a variation of the Randíc index. Australas. J Comb. Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski
2013	J	`jnl`	Wiener index of iterated line graphs of trees homeomorphic to the claw Ars Math. Contemp. Martin Knor, Primoz Potocnik, Riste Skrekovski
2013	J	`jnl`	Wiener index of iterated line graphs of trees homeomorphic to. Discret. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2012	J	`jnl`	Biembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs. Electron. J. Comb. Michael John Grannell, Martin Knor
2012	J	`jnl`	Efficient domination in cubic vertex-transitive graphs. Eur. J. Comb. Martin Knor, Primoz Potocnik
2012	J	`jnl`	Hyperbolic analogues of fullerenes on orientable surfaces. Discret. Math. Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski
2012	J	`jnl`	On a conjecture about Wiener index in iterated line graphs of trees. Discret. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2012	J	`jnl`	On the number of triangular embeddings of complete graphs and complete tripartite graphs. J. Graph Theory Mike J. Grannell, Martin Knor
2012	J	`jnl`	Small radial Moore graphs of radius 3. Australas. J Comb. Martin Knor
2012	J	`jnl`	The Wiener index in iterated line graphs. Discret. Appl. Math. Martin Knor, Primoz Potocnik, Riste Skrekovski
2011	J	`jnl`	A Construction for Biembeddings of Latin Squares. Electron. J. Comb. Mike J. Grannell, Martin Knor
2011	J	`jnl`	A study of 3-arc graphs. Discret. Appl. Math. Martin Knor, Guangjun Xu, Sanming Zhou
2011	J	`jnl`	Biembeddings of Latin squares obtained from a voltage construction. Australas. J Comb. Mike J. Grannell, Martin Knor
2011	J	`jnl`	Efficient open domination in digraphs. Australas. J Comb. Ludovít Niepel, Martin Knor
2010	J	`jnl`	A lower bound for the number of orientable triangular embeddings of some complete graphs. J. Comb. Theory B Mike J. Grannell, Martin Knor
2010	J	`jnl`	Diameter and connectivity of 3-arc graphs. Discret. Math. Martin Knor, Sanming Zhou
2010	J	`jnl`	Domination In The Cross Product Of Digraphs. Ars Comb. Ludovít Niepel, Martin Knor
2009	J	`jnl`	Domination in a digraph and in its reverse. Discret. Appl. Math. Ludovít Niepel, Martin Knor
2009	J	`jnl`	On Biembeddings of Latin Squares. Electron. J. Comb. Mike J. Grannell, Terry S. Griggs, Martin Knor
2009	J	`jnl`	Unicyclic radially-maximal graphs on the minimum number of vertices. Australas. J Comb. Martin Knor
2008	J	`jnl`	A census of the orientable biembeddings of Steiner triple systems of order 15. Australas. J Comb. Mike J. Grannell, Terry S. Griggs, Martin Knor, A. R. W. Thrower
2008	J	`jnl`	Regular hamiltonian embeddings of K Discret. Math. Martin Knor, Jozef Sirán
2007	J	`jnl`	Minimal non-selfcentric radially-maximal graphs of radius 4. Discuss. Math. Graph Theory Martin Knor
2006	J	`jnl`	Distance Independent Domination In Iterated Line Graphs. Ars Comb. Martin Knor, Ludovít Niepel
2006	J	`jnl`	Iterated line graphs are maximally ordered. J. Graph Theory Martin Knor, Ludovít Niepel
2006	J	`jnl`	Linkability in iterated line graphs. Discret. Math. Thomas Böhme, Martin Knor, Ludovít Niepel
2006	J	`jnl`	Triangulations of orientable surfaces by complete tripartite graphs. Discret. Math. Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán
2004	J	`jnl`	A Steiner triple system which colors all cubic graphs. J. Graph Theory Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera
2004	J	`jnl`	Independence Number in Path Graphs. Comput. Artif. Intell. Martin Knor, Ludovít Niepel
2003	J	`jnl`	Connectivity of iterated line graphs. Discret. Appl. Math. Martin Knor, Ludovít Niepel
2002	J	`jnl`	Connectivity of path graphs. Australas. J Comb. Martin Knor, Ludovít Niepel, Maryam Malah
2001	J	`jnl`	Diameter in iterated path graphs. Discret. Math. Martin Knor, Ludovít Niepel
2000	J	`jnl`	Connectivity of path graphs. Discuss. Math. Graph Theory Martin Knor, Ludovít Niepel
1997	J	`jnl`	Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. J. Graph Theory Martin Knor, Jozef Sirán
1996	J	`jnl`	A Note on Radially Moore Digraphs. IEEE Trans. Computers Martin Knor
1996	J	`jnl`	Characterization of minor-closed pseudosurfaces. Ars Comb. Martin Knor
1996	J	`jnl`	Distances in iterated line graphs. Ars Comb. Ludovít Niepel, Martin Knor, Lubomír Soltés
1996	J	`jnl`	On Ramsey-type games for graphs. Australas. J Comb. Martin Knor
1996	J	`jnl`	Radii and centers in iterated line digraphs. Discuss. Math. Graph Theory Martin Knor, Ludovít Niepel
1994	J	`jnl`	On radially maximal graphs. Australas. J Comb. Ferdinand Gliviak, Martin Knor, Lubomír Soltés