Chromatic number and the 2-rank of a graph

DOI10.1006/jctb.2000.2003zbMath1026.05046OpenAlexW2066522339MaRDI QIDQ1850515

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2003

zbMATH Keywords

adjacency matrix bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items

The automorphism group of the \(s\)-stable Kneser graphs ⋮ Nonisotropic symplectic graphs over finite commutative rings ⋮ Topology selection for multi-agent systems with opposite leaders ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Characterizing bipartite consensus on signed matrix-weighted networks via balancing set ⋮ Arithmetical structures on graphs with connectivity one ⋮ 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\) ⋮ Graph homomorphisms and nodal domains ⋮ On the locating matrix of a graph and its spectral analysis ⋮ 5-chromatic strongly regular graphs ⋮ On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem ⋮ Adaptive consensus of multi-agents in networks with jointly connected topologies ⋮ The chromatic number and rank of the complements of the Kasami graphs ⋮ Isodual and Self-dual Codes from Graphs ⋮ The eigenvalues of the graphs \(D(4,q)\) ⋮ On top locally-\(s\)-distance-transitive graphs ⋮ Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs ⋮ 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 ⋮ Distributed model based event-triggered control for synchronization of multi-agent systems ⋮ A survey of multi-agent formation control ⋮ Ramanujan coverings of graphs ⋮ Codes associated with the odd graphs ⋮ Convergence and synchronization in heterogeneous networks of smooth and piecewise smooth systems ⋮ Selective pattern formation control: spatial spectrum consensus and Turing instability approach ⋮ Depth-based hypergraph complexity traces from directed line graphs ⋮ Partial synchronization in networks of non-linearly coupled oscillators: The Deserter Hubs Model ⋮ A valency bound for distance-regular graphs ⋮ Odd covers of graphs ⋮ On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ The eigenvalues of \(q\)-Kneser graphs ⋮ More on symplectic graphs modulo \(p^n\) ⋮ Graph reductions, binary rank, and pivots in gene assembly ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Depth-based complexity traces of graphs ⋮ Orthogonal graphs of odd characteristic and their automorphisms ⋮ On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ On the internal stability of diffusively coupled multi-agent systems and the dangers of cancel culture ⋮ Adjacency preservers, symmetric matrices, and cores ⋮ Full automorphism group of generalized unitary graphs ⋮ Association schemes coming from minimal flats in classical polar spaces ⋮ Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs ⋮ On order and rank of graphs ⋮ The smooth structure of the moduli space of a weighted series-parallel graph ⋮ On the critical ideals of graphs ⋮ Codes from incidence matrices of graphs ⋮ Hulls of codes from incidence matrices of connected regular 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 ⋮ Subconstituents of symplectic graphs ⋮ Finite 3-set-homogeneous graphs ⋮ Research problems from the Aveiro workshop on graph spectra ⋮ New graphs related to \((p,6)\) and \((p,8)\)-cages ⋮ On geodesic transitive graphs ⋮ Extrema of graph eigenvalues ⋮ Observer-based semi-global containment of saturated multi-agent systems with uncertainties ⋮ A note on the positive semidefiniteness of \(A_{\alpha}(G)\) ⋮ Clique-inserted-graphs and spectral dynamics of clique-inserting ⋮ Consensus conditions for high-order multiagent systems with nonuniform delays ⋮ Algebraic connectivity and degree sequences of trees ⋮ Subconstituents of the orthogonal graph of type \((m,m-1,0)\) of odd characteristic ⋮ The maximum order of adjacency matrices of graphs with a given rank ⋮ Star complements in regular graphs: old and new results ⋮ A geometrical characterization of strongly regular graphs ⋮ On the nullspace of arc-transitive graphs over finite fields ⋮ Minimal Euclidean representations of graphs ⋮ Bipancyclic properties of Cayley graphs generated by transpositions ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Model predictive and non-cooperative dynamic game fault recovery control strategies for a network of unmanned underwater vehicles ⋮ Relationship between the rank and the matching number of a graph ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ Spectral upper bounds for the order of a \(k\)-regular induced subgraph ⋮ Distributed control for multiagent consensus motions with nonuniform time delays ⋮ Cayley graphs over Green \(^*\) relations of abundant semigroups ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ Bayesian inference in a time varying cointegration model ⋮ Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs ⋮ Finite-time control of perturbed dynamical systems based on a generalized time transformation approach ⋮ Strongly regular tri-Cayley graphs ⋮ Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius ⋮ On a conjecture of Brouwer involving the connectivity of strongly regular graphs ⋮ A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree ⋮ Unnamed Item ⋮ Distributed-observer-based output synchronization for heterogeneous double-integral networks ⋮ Orthogonal graph of type (m,m – 1,0) of characteristic 2 and its subconstituents ⋮ Symplectic graphs and their automorphisms ⋮ Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets ⋮ Distributed coestimation in heterogeneous sensor networks ⋮ Generalized symmetry of graphs ⋮ Equitable switching and spectra of graphs ⋮ Spectral condition for Hamiltonicity of a graph

Cites Work

This page was built for publication: Chromatic number and the 2-rank of a graph