Algebraic Graph Theory
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Graph theory (05Cxx)
Recommendations
- scientific article; zbMATH DE number 1600999
- scientific article; zbMATH DE number 1432797
- scientific article; zbMATH DE number 1857662
- scientific article; zbMATH DE number 2123603
- Algorithmische Graphentheorie
- Algorithmische Graphentheorie
- Algorithmische Graphentheorie
- scientific article; zbMATH DE number 2183075
- scientific article; zbMATH DE number 5842506
- Algebraic graph theory. Morphisms, monoids and matrices
Cited in
(only showing first 100 items - show all)- Parameterized complexity of finding regular induced subgraphs
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Trivalent orbit polynomial graphs
- Chip-firing and the critical group of a graph
- Codimension-one foliations and oriented graphs
- Algebraic graph theory without orientation
- On adjacency-transitive graphs
- Landscapes and their correlation functions
- Node balanced steady states: unifying and generalizing complex and detailed balanced steady states
- Edge-girth-regular graphs
- On arc-transitive metacyclic covers of graphs with order twice a prime
- Concentric network symmetry
- Connected domination polynomial of graphs
- On two generalized connectivities of graphs
- Further results on color energy of graphs
- Synchronization problem of 2-D coupled dynamical networks with communication delays and missing measurements
- A mathematical design of genetic operators on \(\mathrm{GL}_n(\mathbb Z_2)\)
- Circular formation control for cooperative target tracking with limited information
- Generalized quasispecies model on finite metric spaces: isometry groups and spectral properties of evolutionary matrices
- Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems
- The full automorphism groups, determining sets and resolving sets of coprime graphs
- The Tutte polynomial as a growth function
- An inequality involving the local eigenvalues of a distance-regular graph
- The subconstituent algebra of a distance-regular graph; thin modules with endpoint one
- Tight distance-regular graphs and the subconstituent algebra
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Cayley properties of the line graphs induced by consecutive layers of the hypercube
- A Harary-Sachs theorem for hypergraphs
- A classification of tetravalent non-normal Cayley graphs of order twice a prime square
- A discrete Morse perspective on knot projections and a generalised clock theorem
- The enumeration of spanning tree of weighted graphs
- On the N-spectrum of oriented graphs
- On finite dual Cayley graphs
- Spectral threshold for extremal cyclic edge-connectivity
- Counterexamples to the classical central limit theorem for triplewise independent random variables having a common arbitrary margin
- Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
- Multi-agent control: a graph-theoretic perspective
- Linear k-arboricity of Caylay graphs on abelian groups with given degree
- Counting spanning trees in almost complete multipartite graphs
- On the energy of transposition graphs
- Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
- Kissing numbers of regular graphs
- Classical symmetries and the quantum approximate optimization algorithm
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- On monoid graphs
- Vertex-transitive diameter two graphs
- On bipartite graphs having minimum fourth adjacency coefficient
- On automorphisms of the double cover of a circulant graph
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- Identifiable paths and cycles in linear compartmental models
- An analysis of random elections with large numbers of voters
- The many facets of the Estrada indices of graphs and networks
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- Unlocking the walk matrix of a graph
- Eigenvalues of Cayley graphs
- Computational complexity of covering disconnected multigraphs
- On characterization of a completely simple semigroup by its power graph and Green relations
- Matching numbers in fuzzy graphs
- GHWs of codes arising from Cartesian product of graphs
- Synchronous control of multiple electrohydraulic actuators under distributed switching topologies with lumped uncertainty
- On bounding the diameter of a distance-regular graph
- Applications of the Harary-Sachs theorem for hypergraphs
- Adjacency and transition matrices related to random walks on graphs
- The DP color function of joins and vertex-gluings of graphs
- List covering of regular multigraphs
- More connections between the matching polynomial and the chromatic polynomial
- The non-negative spectrum of a digraph
- Collective circular motion in synchronized and balanced formations with second-order rotational dynamics
- A connection between a question of Bermond and Bollobás and Ramanujan graphs
- Correction to: ``A classification of spectrum-determined circulant digraphs
- Spectra and eigenspaces of arbitrary lifts of graphs
- Heptavalent symmetric graphs of order 24p
- Distributed transient frequency control for power networks with stability and performance guarantees
- Effective fluctuation and response theory
- Matrices associated with D-distance magic graphs and their properties
- The complexity of some classes of pyramid graphs created from a gear graph
- The Rabin cryptosystem revisited
- Asymptotics for the determinant of the combinatorial Laplacian on hypercubic lattices
- Isotropic matroids. III: Connectivity
- The energy of the alphabet model
- Universality in perfect state transfer
- On the independence number of Cayley digraphs of rectangular groups
- Finite \(s\)-geodesic transitive graphs which are locally disconnected
- The automorphism group of the bipartite Kneser graph
- A family of edge-transitive Cayley graphs
- On 2-distance-transitive circulants
- On almost distance-regular graphs
- The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
- Taut distance-regular graphs and the subconstituent algebra
- Tetravalent arc-transitive graphs of order \(3p^2\)
- Matroid invariants and counting graph homomorphisms
- Complexes of discrete Morse functions
- Spectrally extremal vertices, strong cospectrality, and state transfer
- Graph diameter, eigenvalues, and minimum-time consensus
- Signless Laplacian energy of a first KCD matrix
- Event-triggered \(H_\infty\) leader-follower consensus for nonlinear multi-agent systems with fixed and switching network topologies
- On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
- On quiver representations over \(\mathbb{F}_1\)
- Matiyasevich formula for chromatic and flow polynomials and Feynman amplitudes
- Improved upper and lower bounds for k-broadcasting
This page was built for publication: Algebraic Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291710)