Indistinguishable trees and graphs
type: Item
instance of: scholarly article
title: Indistinguishable trees and graphs
zbMATH Open document ID: 1306.05165
author: Hua Wang
author: Stephan Wagner
published in: Graphs and Combinatorics
publication date: 2015-01-20T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6388157
zbMATH Keywords: non-isomorphic graphs
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: matchings
zbMATH Keywords: independent sets
zbMATH Keywords: connected subgraphs
MaRDI profile type: Publication
full work available at URL: s00373-013-1360-6
OpenAlex ID: W2024110920
cites work: A Course in Enumeration
cites work: Q3642517
cites work: Recent results in the theory of graph spectra
cites work: Wiener index of trees: Theory and applications
cites work: Q4129488
cites work: Q4044629
cites work: Q5516079
cites work: On some counting polynomials in chemistry
cites work: On the average number of nodes in a subtree of a tree
cites work: Pseudosimilar vertices in a graph
cites work: On pseudosimilarity in trees
cites work: Q4940041
cites work: Constructing graphs with several pseudosimilar vertices or edges
cites work: Q5676231
DOI: 10.1007/S00373-013-1360-6
description: scientific article; zbMATH DE number 6388157