scientific article; zbMATH DE number 1055145

Publication date: 31 August 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

combinatorics discrete mathematics graph theory vulnerability probabilistic method domination computer science graph decomposition extremal graph theory graph labelings voltage graphs chemistry

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion ⋮ Directed graphs and combinatorial properties of semigroups ⋮ Intervals and steps in a connected graph ⋮ On polynomial digraphs ⋮ A partitional clustering algorithm validated by a clustering tendency index based on graph theory ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ The interval function of a connected graph and road systems ⋮ Stratification and domination in graphs. II ⋮ Edge-connectivity in \(P_k\)-path graphs ⋮ A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected ⋮ On the connectivity of diamond-free graphs ⋮ Extremal irregular digraphs ⋮ The poset on connected induced subgraphs of a graph need not be Sperner ⋮ A formula for the number of labelled trees ⋮ Note on the connectivity of line graphs ⋮ Iterated endorsement deduction and ranking ⋮ Minimum degree conditions for the strength and bandwidth of graphs ⋮ Some general aspects of the framing number of a digraph ⋮ Degree sequences and the existence of \(k\)-factors ⋮ A Nordhaus-Gaddum-type result for the induced path number ⋮ Broadcast domination and multipacking in strongly chordal graphs ⋮ Nordhaus--Gaddum bounds for independent domination ⋮ Splitting and contractible edges in 4-connected graphs ⋮ A note on the crossing numbers of 5-regular graphs ⋮ Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement ⋮ On the order of \((\{r,m\};g)\)-cages of even girth ⋮ On second order degree of graphs ⋮ On completely positive graphs and their complements ⋮ Distance and connectivity measures in permutation graphs ⋮ Subcolorings and the subchromatic number of a graph ⋮ Stratification and domination in graphs ⋮ Forbidden induced subgraphs for perfect matchings ⋮ On \((\mathrm{K}_t-e)\)-saturated graphs ⋮ On the sign patterns of the smallest signless Laplacian eigenvector ⋮ Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors ⋮ On upper domination Ramsey numbers for graphs. ⋮ Automorphism groups of \(k\)-arc transitive covers. ⋮ Chordality and 2-factors in tough graphs ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ Bipartite rainbow Ramsey numbers. ⋮ Cycles within specified distance from each vertex. ⋮ The depression of a graph and \(k\)-kernels ⋮ On the number of weakly connected subdigraphs in random \(k\)NN digraphs ⋮ The geodetic number of an oriented graph ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ Edge-dominating cycles in graphs ⋮ On the edge-connectivity and restricted edge-connectivity of a product of graphs ⋮ Multipartite tournaments: a survey ⋮ Local-edge-connectivity in digraphs and oriented graphs ⋮ Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs ⋮ Trees with depression three ⋮ On local connectivity of graphs ⋮ Forbidden subgraphs that imply 2-factors ⋮ Degree sum and connectivity conditions for dominating cycles ⋮ Graphs of NMS flows on \(S^{3}\) with knotted saddle orbits and no heteroclinic trajectories ⋮ On simple graphs arising from exponential congruences ⋮ A note on internally disjoint alternating paths in bipartite graphs ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ A pair of forbidden subgraphs and perfect matchings. ⋮ Some generalized bipartite Ramsey numbers involving short cycles ⋮ On arc-regular permutation groups using Latin squares ⋮ Identity orientation of complete bipartite graphs ⋮ Structural remarks on bipartite graphs with unique \(f\)-factors ⋮ Toughness in graphs -- a survey ⋮ Cuts leaving components of given minimum order ⋮ Characterizations of Clifford semigroup digraphs ⋮ De Bruijn and Kautz digraphs of a rooted tree ⋮ Some bounds on the \(p\)-domination number in trees ⋮ Altitude of regular graphs with girth at least five ⋮ Structure of digraphs associated with quadratic congruences with composite moduli ⋮ Combinatorially orthogonal matrices and related graphs ⋮ Observability of the extended Fibonacci cubes ⋮ A linear-programming approach to the generalized Randić index ⋮ Galois graphs: Walks, trees and automorphisms ⋮ Long cycles in triangle-free graphs with prescribed independence number and connectivity ⋮ Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 ⋮ Semitotal domination of Harary graphs ⋮ Endo-circulant digraphs: Connectivity and generalized cycles ⋮ On the out-domination and in-domination numbers of a digraph ⋮ On the existence of \((d,k)\)-digraphs ⋮ Graphs with large restrained domination number ⋮ An algebraic approach to lifts of digraphs ⋮ A new approach to gross error detection for GPS networks ⋮ A look at cycles containing specified elements of a graph ⋮ Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs ⋮ A survey of stratified domination in graphs ⋮ On 3-Steiner simplicial orderings ⋮ Domination with exponential decay ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ IC-colorings and IC-indices of graphs ⋮ Minus domination in graphs ⋮ On perfect neighborhood sets in graphs ⋮ Packing in trees ⋮ Toughness and the existence of \(k\)-factors. III ⋮ A note on 2-factors with two components ⋮ On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs ⋮ Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\) ⋮ Characterizing the scale dimension of a high-dimensional classification problem ⋮ On a conjecture on the order of cages with a given girth pair

This page was built for publication: