Martin Knor

According to our database1, Martin Knor authored at least 72 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

The structure of graphs with given number of blocks and the maximum Wiener index.
J. Comb. Optim., 2020

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs.
Discret. Appl. Math., 2020

Maximal Wiener index for graphs with prescribed number of blocks.
Appl. Math. Comput., 2020

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

Unicyclic graphs with the maximal value of Graovac-Pisanski index.
Ars Math. Contemp., 2019

Trees with the maximal value of Graovac-Pisanski index.
Appl. Math. Comput., 2019

On the minimum distance in a <i>k</i>-vertex set in a graph.
Appl. Math. Comput., 2019

An inequality between variable wiener index and variable szeged index.
Appl. Math. Comput., 2019

2018
Graphs preserving total distance upon vertex removal.
Electron. Notes Discret. Math., 2018

Graphs whose Wiener index does not change when a specific vertex is removed.
Discret. Appl. Math., 2018

Graphs preserving Wiener index upon vertex removal.
Appl. Math. Comput., 2018

On a conjecture about the ratio of Wiener index in iterated line graphs.
Art Discret. Appl. Math., 2018

2017
On the minimum value of sum-Balaban index.
Appl. Math. Comput., 2017

On the difference between the Szeged and the Wiener index.
Appl. Math. Comput., 2017

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

Orientations of graphs with maximum Wiener index.
Discret. Appl. Math., 2016

Mathematical aspects of Wiener index.
Ars Math. Contemp., 2016

A search for the minimum value of Balaban index.
Appl. Math. Comput., 2016

Digraphs with large maximum Wiener index.
Appl. Math. Comput., 2016

Some remarks on Wiener index of oriented graphs.
Appl. Math. Comput., 2016

Dominance in a Cayley digraph and in its reverse.
Australas. J Comb., 2016

2015
Sandwiching the (generalized) Randić index.
Discret. Appl. Math., 2015

An inequality between the edge-Wiener index and the Wiener index of a graph.
Appl. Math. Comput., 2015

2014
Smallest Vertex-Transitive Graphs of Given Degree and Diameter.
J. Graph Theory, 2014

Smallest regular graphs of given degree and diameter.
Discuss. Math. Graph Theory, 2014

Relationship between the edge-Wiener index and the Gutman index of a graph.
Discret. Appl. Math., 2014

Complete solution of equation W(L<sup>3</sup>(T))=W(T) for the Wiener index of iterated line graphs of trees.
Discret. Appl. Math., 2014

Wiener index of generalized 4-stars and of their quadratic line graphs.
Australas. J Comb., 2014

2013
Line graph operation and small worlds.
Inf. Process. Lett., 2013

Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs.
Graphs Comb., 2013

Wiener index of iterated line graphs of trees homeomorphic to.
Discret. Math., 2013

Wiener index of iterated line graphs of trees homeomorphic to the claw <i>K</i><sub>1, 3</sub>.
Ars Math. Contemp., 2013

A note on 2-subset-regular self-complementary 3-uniform hypergraphs.
Ars Comb., 2013

On a variation of the Randíc index.
Australas. J Comb., 2013

2012
On the number of triangular embeddings of complete graphs and complete tripartite graphs.
J. Graph Theory, 2012

Efficient domination in cubic vertex-transitive graphs.
Eur. J. Comb., 2012

Hyperbolic analogues of fullerenes on orientable surfaces.
Discret. Math., 2012

On a conjecture about Wiener index in iterated line graphs of trees.
Discret. Math., 2012

The Wiener index in iterated line graphs.
Discret. Appl. Math., 2012

Biembeddings of Metacyclic Groups and Triangulations of Orientable Surfaces by Complete Graphs.
Electron. J. Comb., 2012

Small radial Moore graphs of radius 3.
Australas. J Comb., 2012

2011
A study of 3-arc graphs.
Discret. Appl. Math., 2011

A Construction for Biembeddings of Latin Squares.
Electron. J. Comb., 2011

Efficient open domination in digraphs.
Australas. J Comb., 2011

Biembeddings of Latin squares obtained from a voltage construction.
Australas. J Comb., 2011

2010
A lower bound for the number of orientable triangular embeddings of some complete graphs.
J. Comb. Theory, Ser. B, 2010

Diameter and connectivity of 3-arc graphs.
Discret. Math., 2010

Domination In The Cross Product Of Digraphs.
Ars Comb., 2010

2009
Domination in a digraph and in its reverse.
Discret. Appl. Math., 2009

On Biembeddings of Latin Squares.
Electron. J. Comb., 2009

Unicyclic radially-maximal graphs on the minimum number of vertices.
Australas. J Comb., 2009

2008
Regular hamiltonian embeddings of K<sub>n, n</sub> and regular triangular embeddings of K<sub>n, n, n</sub>.
Discret. Math., 2008

A census of the orientable biembeddings of Steiner triple systems of order 15.
Australas. J Comb., 2008

2007
Minimal non-selfcentric radially-maximal graphs of radius 4.
Discuss. Math. Graph Theory, 2007

2006
Iterated line graphs are maximally ordered.
J. Graph Theory, 2006

Triangulations of orientable surfaces by complete tripartite graphs.
Discret. Math., 2006

Linkability in iterated line graphs.
Discret. Math., 2006

Distance Independent Domination In Iterated Line Graphs.
Ars Comb., 2006

2004
A Steiner triple system which colors all cubic graphs.
J. Graph Theory, 2004

Independence Number in Path Graphs.
Comput. Artif. Intell., 2004

2003
Connectivity of iterated line graphs.
Discret. Appl. Math., 2003

2002
Connectivity of path graphs.
Australas. J Comb., 2002

2001
Diameter in iterated path graphs.
Discret. Math., 2001

2000
Connectivity of path graphs.
Discuss. Math. Graph Theory, 2000

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

1996
A Note on Radially Moore Digraphs.
IEEE Trans. Computers, 1996

Radii and centers in iterated line digraphs.
Discuss. Math. Graph Theory, 1996

Distances in iterated line graphs.
Ars Comb., 1996

Characterization of minor-closed pseudosurfaces.
Ars Comb., 1996

On Ramsey-type games for graphs.
Australas. J Comb., 1996

1994
On radially maximal graphs.
Australas. J Comb., 1994


  Loading...