Spectral Theory and Analysis

DOI10.1007/978-3-7643-9994-8zbMath1210.05001MaRDI QIDQ5747542

Gregory Gutin, Jörgen Bang-Jensen

Publication date: 13 September 2010

Full work available at URL: https://doi.org/10.1007/978-3-7643-9994-8

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Related Items

ON FREE SPECTRA OF VARIETIES OF LOCALLY THRESHOLD TESTABLE SEMIGROUPS, Unnamed Item, Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy, EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS, Supereulerian digraphs with given local structures, Cycle-connected mixed graphs and related problems, Locality and Centrality: The Variety ZG, Acyclic coloring of products of digraphs, A myopic adjustment process for mean field games with finite state and action space, Geometric and spectral analysis on weighted digraphs, Dicycle cover of Hamiltonian oriented graphs, Solving min ones 2-SAT as fast as vertex cover, Shattering, graph orientations, and connectivity, An ILP-refined tabu search for the directed profitable rural postman problem, A sufficient condition for the existence of an anti-directed 2-factor in a directed graph, Complexity-sensitive decision procedures for abstract argumentation, Derivation digraphs for dependencies in ordinal and similarity-based data, Directed elimination games, Finding even subgraphs even faster, Meta-modeling game for deriving theory-consistent, microstructure-based traction-separation laws via deep reinforcement learning, A non-cooperative meta-modeling game for automated third-party calibrating, validating and falsifying constitutive laws with parallelized adversarial attacks, Geometric deep learning for computational mechanics. I: Anisotropic hyperelasticity, Analyzing clustering and partitioning problems in selected VLSI models, Some constructions of quasi-strongly regular digraphs, Graphical structure of double controlled metric-like spaces with an application, Minimum arc-cuts of normally regular digraphs and Deza digraphs, Hamiltonian problems in directed graphs with simple row patterns, Some results on Berge's conjecture and begin-end conjecture, The 1-good neighbor connectivity of unidirectional star graph networks, Routing with congestion in acyclic digraphs, The order of hypotraceable oriented graphs, On the dual of the solvency cone, New spectral bounds on \(\mathcal{H}_2\)-norm of linear dynamical networks, A paradox of expert rights in abstract argumentation, Clustering without replication in combinatorial circuits, On the number of update digraphs and its relation with the feedback arc sets and tournaments, Hamiltonicity of large generalized de Bruijn cycles, The NL-flow polynomial, ON FREE SPECTRA OF LOCALLY TESTABLE SEMIGROUP VARIETIES