Slobodan K. Simic

Discret. Appl. Math., 2019

2018

Fast algorithms for computing the characteristic polynomial of threshold and chain graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2016

Signed line graphs with least eigenvalue -2: The star complement technique.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2012

Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Some Notes On Spectra Of Cographs.

[BibT_eX]

Türker Bíyíkoglu

Ars Comb., 2011

On ordering bicyclic graphs with respect to the Laplacian spectral radius.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

On the Index of Necklaces.

[BibT_eX]

[DOI]

Graphs Comb., 2010

Trees with minimal index and diameter at most four.

[BibT_eX]

[DOI]

Discret. Math., 2010

Some notes on the threshold graphs.

[BibT_eX]

[DOI]

Milica Andelic

Discret. Math., 2010

Spectral determination of graphs whose components are paths and cycles.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

Graphs for small multiprocessor interconnection networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2010

2009

On some forests determined by their Laplacian or signless Laplacian spectrum.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2009

2008

Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Q-integral graphs with edge-degrees at most five.

[BibT_eX]

[DOI]

Discret. Math., 2008

On the index of caterpillars.

[BibT_eX]

[DOI]

Discret. Math., 2008

Ordering graphs with index in the interval (2, sqrt(2+sqrt(5))).

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

On the analytical solution of some families of transcendental equations.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2007

2005

Graphs With Least Eigenvalue <i>-2</i>: A New Proof of the 31 Forbidden Subgraphs Theorem.

[BibT_eX]

[DOI]

Peter Rowlinson

Des. Codes Cryptogr., 2005

2004

Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues?

[BibT_eX]

[DOI]

Krystyna T. Balinska

Krzysztof T. Zwierzyski

Discret. Math., 2004

2002

The Maximal Exceptional Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

2001

The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties.

[BibT_eX]

[DOI]

Krystyna T. Balinska

Discret. Math., 2001

Graph Theoretical Results Obtained by the Support of the Expert System "Graph" - An Extended Survey.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Discovery, 2001

1999

Some additions to the theory of star partitions of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1999

1995

On graphs whose second largest eigenvalue does not exceed (sqrt(5)-1)/2.

[BibT_eX]

[DOI]

Discret. Math., 1995

on Some Algorithmic Investigations of Star Partitions of Graphs.

[BibT_eX]

[DOI]

Peter Rowlinson

Discret. Appl. Math., 1995

1981

Generalized line graphs.

[BibT_eX]

[DOI]

Michael Doob

J. Graph Theory, 1981

1979

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian.

[BibT_eX]

[DOI]

David J. Oberly

David P. Sumner

J. Graph Theory, 1979

A bibliography of graph equations.

[BibT_eX]

[DOI]

J. Graph Theory, 1979

1975

Graph equations for line graphs and total graphs.

[BibT_eX]

[DOI]