Chromatic number and the 2-rank of a graph
From MaRDI portal
Recommendations
Cites work
- A counterexample to the rank-coloring conjecture
- Characterizations of certain classes of graphs
- scientific article; zbMATH DE number 3834008 (Why is no real title available?)
- scientific article; zbMATH DE number 4035881 (Why is no real title available?)
- scientific article; zbMATH DE number 3775784 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 107643 (Why is no real title available?)
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 842877 (Why is no real title available?)
- ON EIGENVALUES AND COLORINGS OF GRAPHS, II
- On the ``log rank-conjecture in communication complexity
- Orthogonal representations over finite fields and the chromatic number of graphs
- Ovoids and spreads of finite classical polar spaces
- Rank and chromatic number of a graph
- Simple Lie algebras and graphs
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
- The rank and size of graphs
Cited in
(only showing first 100 items - show all)- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Strongly regular tri-Cayley graphs
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
- On the graph chromatic number and the rank of a matrix associated with the graph
- Rank, term rank, and chromatic number
- On the locating matrix of a graph and its spectral analysis
- Ramanujan coverings of graphs
- A valency bound for distance-regular graphs
- On order and rank of graphs
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- Semi-global leader-following coordination of multi-agent systems with input saturation and aperiodic intermittent communications
- A geometrical characterization of strongly regular graphs
- On the nullspace of arc-transitive graphs over finite fields
- Rank, term rank and chromatic number of a graph
- Distributed control for multiagent consensus motions with nonuniform time delays
- Equitable switching and spectra of graphs
- Graph Laplacians, nodal domains, and hyperplane arrangements
- More on symplectic graphs modulo \(p^n\)
- Codes from incidence matrices of graphs
- Consensus conditions for high-order multiagent systems with nonuniform delays
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Relationship between the rank and the matching number of a graph
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- Nonisotropic symplectic graphs over finite commutative rings
- Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
- On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem
- Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
- Maximum order of graphs with a given corank
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- Finite 3-set-homogeneous graphs
- Observer-based semi-global containment of saturated multi-agent systems with uncertainties
- Cayley graphs over Green \(^*\) relations of abundant semigroups
- Finite-time control of perturbed dynamical systems based on a generalized time transformation approach
- Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- Distributed-observer-based output synchronization for heterogeneous double-integral networks
- The automorphism group of the s-stable Kneser graphs
- Adaptive consensus of multi-agents in networks with jointly connected topologies
- The eigenvalues of the graphs \(D(4,q)\)
- On top locally-\(s\)-distance-transitive graphs
- Distributed model based event-triggered control for synchronization of multi-agent systems
- A survey of multi-agent formation control
- Depth-based hypergraph complexity traces from directed line graphs
- Orthogonal graphs of odd characteristic and their automorphisms
- Graphs of given order and size and minimum algebraic connectivity
- Association schemes coming from minimal flats in classical polar spaces
- Classification of the family AT4(qs,q,q) of antipodal tight graphs
- The smooth structure of the moduli space of a weighted series-parallel graph
- On the critical ideals of graphs
- Hulls of codes from incidence matrices of connected regular graphs
- Research problems from the Aveiro workshop on graph spectra
- Spectral condition for Hamiltonicity of a graph
- Symplectic graphs and their automorphisms
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Subconstituents of symplectic graphs modulo \(p^n\)
- On sufficient spectral radius conditions for Hamiltonicity
- Topology selection for multi-agent systems with opposite leaders
- Arithmetical structures on graphs with connectivity one
- Generalized symmetry of graphs
- A counterexample to the rank-coloring conjecture
- scientific article; zbMATH DE number 1190988 (Why is no real title available?)
- Codes associated with the odd graphs
- The eigenvalues of \(q\)-Kneser graphs
- Graph reductions, binary rank, and pivots in gene assembly
- Adjacency preservers, symmetric matrices, and cores
- Full automorphism group of generalized unitary graphs
- Partial synchronization in networks of non-linearly coupled oscillators: the Deserter Hubs Model
- scientific article; zbMATH DE number 7033505 (Why is no real title available?)
- On geodesic transitive graphs
- The rank and size of graphs
- Extrema of graph eigenvalues
- Distributed coestimation in heterogeneous sensor networks
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- A note on the positive semidefiniteness of \(A_{\alpha}(G)\)
- Subconstituents of the orthogonal graph of type \((m,m-1,0)\) of odd characteristic
- Model predictive and non-cooperative dynamic game fault recovery control strategies for a network of unmanned underwater vehicles
- Orthogonal graph of type \((m,m-1,0)\) of characteristic 2 and its subconstituents
- Isodual and self-dual codes from graphs
- Odd covers of graphs
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
- On the internal stability of diffusively coupled multi-agent systems and the dangers of cancel culture
- New graphs related to \((p,6)\) and \((p,8)\)-cages
- Binding number, odd \([1, b]\)-factors and the distance spectral radius
- Toughness and distance spectral radius in graphs involving minimum degree
- The maximum order of adjacency matrices of graphs with a given rank
- Spectral extremal problems on factors in tough graphs, and beyond
- The classification of two-distance transitive dihedrants
- Bayesian inference in a time varying cointegration model
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Graph homomorphisms and nodal domains
- 5-chromatic strongly regular graphs
- The chromatic number and rank of the complements of the Kasami graphs
- Convergence and synchronization in heterogeneous networks of smooth and piecewise smooth systems
- Selective pattern formation control: spatial spectrum consensus and Turing instability approach
- The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Depth-based complexity traces of graphs
- Subconstituents of symplectic graphs
- On the chromatic number of an oriented matroid
- Clique-inserted-graphs and spectral dynamics of clique-inserting
This page was built for publication: Chromatic number and the 2-rank of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850515)
