Subgraph complementation and minimum rank

DOI10.37236/10383zbMath1486.05205arXiv2101.06180OpenAlexW4213448819MaRDI QIDQ2121776

Calum Buchanan, Puck Rombach, Christopher Purcell

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.06180

zbMATH Keywords

faithful orthogonal representation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Odd covers of graphs ⋮ Cutting a tree with subgraph complementation is hard, except for some small trees

Uses Software

• MathOverflow

Cites Work

• Vector representations of graphs
• On the minimum rank of a graph over finite fields
• Quadratic forms and the graph isomorphism problem
• Minimum rank problems
• Recent developments on graphs of bounded clique-width
• The minimum rank of symmetric matrices described by a graph: a survey
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• Circle graph obstructions
• Orthogonal representations and connectivity of graphs
• On orthogonal representations of graphs
• Subgraph complementation
• Zero forcing sets and the minimum rank of graphs
• A characterization of tridiagonal matrices
• The theory of well-quasi-ordering: a frequently discovered concept
• On minimal rank over finite fields
• Minimum rank of a graph over an arbitrary field
• On the Shannon capacity of a graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

This page was built for publication: Subgraph complementation and minimum rank