default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Knor
Person information
- affiliation: Slovak University of Technology, Bratislava, Slovakia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j78]Vesna Andova
, Pavel Dimovski, Martin Knor, Riste Skrekovski:
Diameter of nanotori. Appl. Math. Comput. 462: 128342 (2024)- 2023
- [j77]Martin Knor, Riste Skrekovski:
On maximum Wiener index of directed grids. Art Discret. Appl. Math. 6(3): 3 (2023) - 2022
- [j76]Nino Basic, Martin Knor, Riste Skrekovski:
On 12-regular nut graphs. Art Discret. Appl. Math. 5(2) (2022) - [j75]Martin Knor, Riste Skrekovski, Ismael G. Yero:
A note on the metric and edge metric dimensions of 2-connected graphs. Discret. Appl. Math. 319: 454-460 (2022) - 2021
- [j74]Martin Knor, Snjezana Majstorovic, Aoden Teo Masa Toshi, Riste Skrekovski, Ismael G. Yero:
Graphs with the edge metric dimension smaller than the metric dimension. Appl. Math. Comput. 401: 126076 (2021) - [j73]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Domination versus independent domination in regular graphs. J. Graph Theory 98(3): 525-530 (2021) - 2020
- [j72]Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh:
Some remarks on Balaban and sum-Balaban index. Art Discret. Appl. Math. 3(2) (2020) - [j71]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380: 125274 (2020) - [j70]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284: 195-200 (2020) - [j69]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39(1): 170-184 (2020) - [j68]Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Skrekovski:
Remarks on Distance Based Topological Indices for ℓ-Apex Trees. Symmetry 12(5): 802 (2020)
2010 – 2019
- 2019
- [j67]Martin Knor, Riste Skrekovski:
On the minimum distance in a k-vertex set in a graph. Appl. Math. Comput. 356: 99-104 (2019) - [j66]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Trees with the maximal value of Graovac-Pisanski index. Appl. Math. Comput. 358: 287-292 (2019) - [j65]Katarína Hrináková, Martin Knor, Riste Skrekovski:
An inequality between variable wiener index and variable szeged index. Appl. Math. Comput. 362 (2019) - [j64]Martin Knor, Jozef Komorník, Riste Skrekovski, Aleksandra Tepeh:
Unicyclic graphs with the maximal value of Graovac-Pisanski index. Ars Math. Contemp. 17(2): 455-466 (2019) - [i2]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR abs/1905.02633 (2019) - [i1]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR abs/1905.04291 (2019) - 2018
- [j63]Martin Knor, Katarína Hrináková, Riste Skrekovski:
On a conjecture about the ratio of Wiener index in iterated line graphs. Art Discret. Appl. Math. 1(1): #P1.09 (2018) - [j62]Martin Knor, Snjezana Majstorovic, Riste Skrekovski:
Graphs preserving Wiener index upon vertex removal. Appl. Math. Comput. 338: 25-32 (2018) - [j61]Martin Knor, Snjezana Majstorovic, Riste Skrekovski:
Graphs whose Wiener index does not change when a specific vertex is removed. Discret. Appl. Math. 238: 126-132 (2018) - [j60]Snjezana Majstorovic, Martin Knor, Riste Skrekovski:
Graphs preserving total distance upon vertex removal. Electron. Notes Discret. Math. 68: 107-112 (2018) - 2017
- [j59]Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh:
On the minimum value of sum-Balaban index. Appl. Math. Comput. 303: 203-210 (2017) - [j58]Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski:
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312: 202-213 (2017) - 2016
- [j57]Martin Knor, Jaromír Sýs:
Dominance in a Cayley digraph and in its reverse. Australas. J Comb. 65: 212-219 (2016) - [j56]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Some remarks on Wiener index of oriented graphs. Appl. Math. Comput. 273: 631-636 (2016) - [j55]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Digraphs with large maximum Wiener index. Appl. Math. Comput. 284: 260-267 (2016) - [j54]Martin Knor, Jaka Kranjc, Riste Skrekovski, Aleksandra Tepeh:
A search for the minimum value of Balaban index. Appl. Math. Comput. 286: 301-310 (2016) - [j53]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Mathematical aspects of Wiener index. Ars Math. Contemp. 11(2): 327-352 (2016) - [j52]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Orientations of graphs with maximum Wiener index. Discret. Appl. Math. 211: 121-129 (2016) - [j51]Martin Knor, Maryam Verdian-Rizi:
Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10). Discret. Math. 339(1): 103-108 (2016) - 2015
- [j50]Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
An inequality between the edge-Wiener index and the Wiener index of a graph. Appl. Math. Comput. 269: 714-721 (2015) - [j49]Martin Knor, Borut Luzar, Riste Skrekovski:
Sandwiching the (generalized) Randić index. Discret. Appl. Math. 181: 160-166 (2015) - 2014
- [j48]Martin Knor, Riste Skrekovski:
Wiener index of generalized 4-stars and of their quadratic line graphs. Australas. J Comb. 58: 119-126 (2014) - [j47]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Relationship between the edge-Wiener index and the Gutman index of a graph. Discret. Appl. Math. 167: 197-201 (2014) - [j46]Martin Knor, Martin Macaj, Primoz Potocnik, Riste Skrekovski:
Complete solution of equation W(L3(T))=W(T) for the Wiener index of iterated line graphs of trees. Discret. Appl. Math. 171: 90-103 (2014) - [j45]Martin Knor:
Smallest regular graphs of given degree and diameter. Discuss. Math. Graph Theory 34(1): 187-191 (2014) - [j44]Martin Knor, Jozef Sirán:
Smallest Vertex-Transitive Graphs of Given Degree and Diameter. J. Graph Theory 75(2): 137-149 (2014) - 2013
- [j43]Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a variation of the Randíc index. Australas. J Comb. 56: 61-76 (2013) - [j42]Martin Knor, Primoz Potocnik:
A note on 2-subset-regular self-complementary 3-uniform hypergraphs. Ars Comb. 111: 33-36 (2013) - [j41]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Wiener index of iterated line graphs of trees homeomorphic to the claw K1, 3. Ars Math. Contemp. 6(2): 211-219 (2013) - [j40]Martin Knor, Primoz Potocnik, Riste Skrekovski:
Wiener index of iterated line graphs of trees homeomorphic to. Discret. Math. 313(10): 1104-1111 (2013) - [j39]Mike J. Grannell, Martin Knor:
Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs. Graphs Comb. 29(4): 921-932 (2013) - [j38]Jelena Govorcin, Martin Knor, Riste Skrekovski:
Line graph operation and small worlds. Inf. Process. Lett. 113(5-6): 196-200 (2013) - 2012
- [j37]Martin Knor:
Small radial Moore graphs of radius 3. Australas. J Comb. 54: 207-216 (2012) - [j36]Michael John Grannell, Martin Knor:
Biembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs. Electron. J. Comb. 19(3): 29 (2012) - [j35]Martin Knor, Primoz Potocnik, Riste Skrekovski:
The Wiener index in iterated line graphs. Discret. Appl. Math. 160(15): 2234-2245 (2012) - [j34]Mathieu Dutour Sikiric, Martin Knor, Primoz Potocnik, Jozef Sirán, Riste Skrekovski:
Hyperbolic analogues of fullerenes on orientable surfaces. Discret. Math. 312(4): 729-736 (2012) - [j33]Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a conjecture about Wiener index in iterated line graphs of trees. Discret. Math. 312(6): 1094-1105 (2012) - [j32]Martin Knor, Primoz Potocnik:
Efficient domination in cubic vertex-transitive graphs. Eur. J. Comb. 33(8): 1755-1764 (2012) - [j31]Mike J. Grannell, Martin Knor:
On the number of triangular embeddings of complete graphs and complete tripartite graphs. J. Graph Theory 69(4): 370-382 (2012) - 2011
- [j30]Ludovít Niepel, Martin Knor:
Efficient open domination in digraphs. Australas. J Comb. 49: 195-202 (2011) - [j29]Mike J. Grannell, Martin Knor:
Biembeddings of Latin squares obtained from a voltage construction. Australas. J Comb. 51: 259-270 (2011) - [j28]Mike J. Grannell, Martin Knor:
A Construction for Biembeddings of Latin Squares. Electron. J. Comb. 18(1) (2011) - [j27]Martin Knor, Guangjun Xu, Sanming Zhou:
A study of 3-arc graphs. Discret. Appl. Math. 159(5): 344-353 (2011) - 2010
- [j26]Ludovít Niepel, Martin Knor:
Domination In The Cross Product Of Digraphs. Ars Comb. 97 (2010) - [j25]Martin Knor, Sanming Zhou:
Diameter and connectivity of 3-arc graphs. Discret. Math. 310(1): 37-42 (2010) - [j24]Mike J. Grannell, Martin Knor:
A lower bound for the number of orientable triangular embeddings of some complete graphs. J. Comb. Theory B 100(2): 216-225 (2010)
2000 – 2009
- 2009
- [j23]Martin Knor:
Unicyclic radially-maximal graphs on the minimum number of vertices. Australas. J Comb. 45: 97-108 (2009) - [j22]Mike J. Grannell, Terry S. Griggs, Martin Knor:
On Biembeddings of Latin Squares. Electron. J. Comb. 16(1) (2009) - [j21]Ludovít Niepel, Martin Knor:
Domination in a digraph and in its reverse. Discret. Appl. Math. 157(13): 2973-2977 (2009) - 2008
- [j20]Mike J. Grannell, Terry S. Griggs, Martin Knor, A. R. W. Thrower:
A census of the orientable biembeddings of Steiner triple systems of order 15. Australas. J Comb. 42: 253-260 (2008) - [j19]Martin Knor, Jozef Sirán:
Regular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n. Discret. Math. 308(20): 4796-4800 (2008) - 2007
- [j18]Martin Knor:
Minimal non-selfcentric radially-maximal graphs of radius 4. Discuss. Math. Graph Theory 27(3): 603-610 (2007) - 2006
- [j17]Martin Knor, Ludovít Niepel:
Distance Independent Domination In Iterated Line Graphs. Ars Comb. 79 (2006) - [j16]Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán:
Triangulations of orientable surfaces by complete tripartite graphs. Discret. Math. 306(6): 600-606 (2006) - [j15]Thomas Böhme, Martin Knor, Ludovít Niepel:
Linkability in iterated line graphs. Discret. Math. 306(7): 666-669 (2006) - [j14]Martin Knor, Ludovít Niepel:
Iterated line graphs are maximally ordered. J. Graph Theory 52(2): 171-180 (2006) - 2004
- [j13]Martin Knor, Ludovít Niepel:
Independence Number in Path Graphs. Comput. Artif. Intell. 23(2): 179-187 (2004) - [j12]Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera:
A Steiner triple system which colors all cubic graphs. J. Graph Theory 46(1): 15-24 (2004) - 2003
- [j11]Martin Knor, Ludovít Niepel:
Connectivity of iterated line graphs. Discret. Appl. Math. 125(2-3): 255-266 (2003) - 2002
- [j10]Martin Knor, Ludovít Niepel, Maryam Malah:
Connectivity of path graphs. Australas. J Comb. 25: 175-184 (2002) - 2001
- [j9]Martin Knor, Ludovít Niepel:
Diameter in iterated path graphs. Discret. Math. 233(1-3): 151-161 (2001) - 2000
- [j8]Martin Knor, Ludovít Niepel:
Connectivity of path graphs. Discuss. Math. Graph Theory 20(2): 181-195 (2000)
1990 – 1999
- 1997
- [j7]Martin Knor, Jozef Sirán:
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. J. Graph Theory 24(1): 1-8 (1997) - 1996
- [j6]Martin Knor:
On Ramsey-type games for graphs. Australas. J Comb. 14: 199-206 (1996) - [j5]Martin Knor:
Characterization of minor-closed pseudosurfaces. Ars Comb. 43 (1996) - [j4]Ludovít Niepel, Martin Knor, Lubomír Soltés:
Distances in iterated line graphs. Ars Comb. 43 (1996) - [j3]Martin Knor, Ludovít Niepel:
Radii and centers in iterated line digraphs. Discuss. Math. Graph Theory 16(1): 17-26 (1996) - [j2]Martin Knor:
A Note on Radially Moore Digraphs. IEEE Trans. Computers 45(3): 381-383 (1996) - 1994
- [j1]Ferdinand Gliviak, Martin Knor, Lubomír Soltés:
On radially maximal graphs. Australas. J Comb. 9: 275-284 (1994)
Coauthor Index
aka: Michael John Grannell
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
