Indistinguishable Trees and Graphs

Title
Indistinguishable Trees and Graphs
Authors
Keywords
Non-isomorphic graphs, Trees, Characteristic polynomial, Matchings, Independent sets, Connected subgraphs, 05C60, 05C05, 05C31
Journal
GRAPHS AND COMBINATORICS
Volume 30, Issue 6, Pages 1593-1605
Publisher
Springer Nature
Online
2013-09-03
DOI
10.1007/s00373-013-1360-6

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started