Indistinguishable trees and graphs

DOI10.1007/s00373-013-1360-6zbMath1306.05165OpenAlexW2024110920MaRDI QIDQ489327

Hua Wang, Stephan G. Wagner

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1360-6

zbMATH Keywords

characteristic polynomialmatchingsindependent setsconnected subgraphsnon-isomorphic graphs

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

On the eccentric subtree number in trees ⋮ On the mean subtree order of trees under edge contraction ⋮ On the mean subtree order of graphs under edge addition ⋮ Random subtrees and unimodal sequences in graphs ⋮ Solution to a conjecture on the mean subtree order of graphs under edge addition ⋮ Decreasing the mean subtree order by adding k edges ⋮ On the roots of the subtree polynomial ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ On the maximum mean subtree order of trees ⋮ On the Mean Connected Induced Subgraph Order of Cographs ⋮ Independence equivalence classes of paths

Cites Work

• On pseudosimilarity in trees
• On some counting polynomials in chemistry
• Recent results in the theory of graph spectra
• Constructing graphs with several pseudosimilar vertices or edges
• On the average number of nodes in a subtree of a tree
• A Course in Enumeration
• Pseudosimilar vertices in a graph
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Indistinguishable trees and graphs