Equitable bipartitions of graphs and related results
From MaRDI portal
Publication:1776263
Recommendations
Cited in
(20)- Equipartitions of graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Extensions and applications of equitable decompositions for graphs with symmetries
- Maximum \(k\)-regular induced subgraphs
- Relations between ( , )-regular sets and star complements.
- Spectral upper bounds on the size of k-regular induced subgraphs
- Efficient domination through eigenvalues
- A recursive construction of the regular exceptional graphs with least eigenvalue -2
- A survey on graphs with convex quadratic stability number
- Unions of a clique and a co-clique as star complements for non-main graph eigenvalues
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- Regular star complements in strongly regular graphs
- On induced matchings as star complements in regular graphs
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Spectral results on graphs with regularity constraints
- Spectral results on regular graphs with (k,)-regular sets
- Star complements in regular graphs: old and new results
- Main eigenvalues and \((\kappa ,\tau )\)-regular sets
- Integral graphs and \((k,\tau )\)-regular sets
This page was built for publication: Equitable bipartitions of graphs and related results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776263)