Feasibility conditions for the existence of walk-regular graphs

From MaRDI portal
Revision as of 04:14, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1148333

DOI10.1016/0024-3795(80)90180-9zbMath0452.05045OpenAlexW2088115893WikidataQ105834921 ScholiaQ105834921MaRDI QIDQ1148333

Chris D. Godsil, Brendan D. McKay

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90180-9




Related Items (68)

The many facets of the Estrada indices of graphs and networksPrincipal submatrices of co-order one with the biggest Perron rootWright-Fisher diffusions in stochastic spatial evolutionary games with death-birth updatingEpidemic Outbreaks in Networks with Equitable or Almost-Equitable PartitionsRegular graphs with four eigenvaluesOn regular graphs with four distinct eigenvaluesFrom local adjacency polynomials to locally pseudo-distance-regular graphsDynamical systems associated with adjacency matricesCharacterizing \((\ell ,m)\)-walk-regular graphsEdge-distance-regular graphs are distance-regularUnique square property, equitable partitions, and product-like graphsOn a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graphNew bounds for the \(\max\)-\(k\)-cut and chromatic number of a graphQuotient-polynomial graphsOn the spectra and spectral radii of token graphsA new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence numberA walk-regular graph, cospectral to its complement, need not be strongly regularThe spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graphOn almost distance-regular graphsThe smallest eigenvalues of the 1-point fixing graphRegular bipartite graphs with three distinct non-negative eigenvaluesGeometric aspects of 2-walk-regular graphsWalk entropies in graphsOn inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationshipNon-existence of bipartite graphs of diameter at least \(4\) and defect \(2\)On the eigenvalues of certain Cayley graphs and arrangement graphsBose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walksA note on completely regular codesPseudo-distance-regularized graphs are distance-regular or distance-biregularEquiarboreal graphsUnnamed ItemState transfer on graphsGraph covers with two new eigenvaluesA NOTE ON NORMALISED HEAT DIFFUSION FOR GRAPHSOn the complexity group of stable curvesOn the non-existence of antipodal cages of even girthCompact graphs and equitable partitionsCompletely regular codesWalk-regular divisible design graphsDistance regular covers of the complete graphOn pseudo-distance-regularityAbout some robustness and complexity properties of \(G\)-graphs networksSome new results on walk regular graphs which are cospectral to its complementCayley graph on symmetric group generated by elements fixing \(k\) pointsEdge-distance-regular graphsOn perturbations of almost distance-regular graphsGraph theory (algorithmic, algebraic, and metric problems)The geometry oft-spreads ink-walk-regular graphsAlgebraic characterizations of regularity properties in bipartite graphsConstructing cospectral signed graphsOn regular signed graphs with three eigenvaluesDevelopments on spectral characterizations of graphsThe alternating and adjacency polynomials, and their relation with the spectra and diameters of graphsChung-Yau Invariants and Graphs with Symmetric Hitting TimesVariance and concurrence in block designs, and distance in the corresponding graphsOptimization of eigenvalue bounds for the independence and chromatic number of graph powersDevelopments in the theory of graph spectraEquitable edge partitions and Kirchhoff graphsPeriodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvaluesAutomorphism groups of graphsSmall regular graphs with four eigenvaluesDiscrete Green's functionsOn t-Cliques in k-Walk-Regular GraphsEigenvalue interlacing and weight parameters of graphsPermutational powers of a graphVertex-removal, vertex-addition and different notions of similarity for vertices of a graphA general method to obtain the spectrum and local spectra of a graph from its regular partitionsOn the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph




Cites Work




This page was built for publication: Feasibility conditions for the existence of walk-regular graphs