Reconstruction from one labelled card and more

DOI10.1016/J.LAA.2023.08.009zbMATH Open1543.05138MaRDI QIDQ6536720FDOQ6536720

Authors: Irene Sciriha, James L. Borg 

Publication date: 13 May 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Reconstructing graphs from a deck of all distinct cards
• Graphs with a common eigenvalue deck
• Reconstruction number for Ulam's conjecture.
• Reconstructibility of the \(K_r\)-count from \(n - 1\) cards
• Families of pairs of graphs with a large number of common cards

zbMATH Keywords

cardgraph reconstructiondeckcommon eigenspacenut-graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Chemical graph theory (05C92)

Cites Work

• Eigenspaces of graphs
• Title not available (Why is that?)
• Polynomial reconstruction and terminal vertices
• On the reconstruction of the characteristic polynomial of a graph
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
• Title not available (Why is that?)
• A congruence theorem for trees
• Almost every graph has reconstruction number three
• The graph reconstruction number
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Minimum-rank matrices with prescribed graph
• A characterization of singular graphs
• Title not available (Why is that?)
• On nut and core singular fullerenes
• A graph polynomial and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with a common eigenvalue deck
• Constructing trees with given eigenvalues and angles
• Interlacing-extremal graphs
• Coalesced and embedded nut graphs in singular graphs
• Existence of regular nut graphs for degree at most 11
• Generation and properties of nut graphs
• Charting the space of chemical nut graphs
• On 12-regular nut graphs
• On the displacement of eigenvalues when removing a twin vertex
• Coalescing Fiedler and core vertices.
• The polynomial reconstruction problem: the first 50 years

Cited In (1)

• Reconstructibility of the \(K_r\)-count from \(n - 1\) cards

This page was built for publication: Reconstruction from one labelled card and more

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536720)