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)

Characterization of eccentric digraphs ⋮ A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ Cospectral digraphs from locally line digraphs ⋮ Breaking symmetry in complete graphs by orienting edges: asymptotic bounds ⋮ Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates ⋮ Domination number in graphs with minimum degree two ⋮ Lower bounds on the vertex-connectivity of digraphs and graphs ⋮ \(H\)-\(V\)-super magic decomposition of complete bipartite graphs ⋮ \(H\)-\(E\)-super magic decomposition of complete bipartite graphs ⋮ Multipartite Moore digraphs ⋮ Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs ⋮ On Cayley graphs of completely 0-simple semigroups ⋮ Two conjectures on graceful digraphs ⋮ Eliminating graphs by means of parallel knock-out schemes ⋮ Toughness and Hamiltonicity in \(k\)-trees ⋮ Degree conditions for Hamiltonicity: counting the number of missing edges ⋮ On Ramsey numbers for paths versus wheels ⋮ Domination in partitioned graphs with minimum degree two ⋮ Graph operations and neighbor rupture degree ⋮ The spectra of some families of digraphs ⋮ Colorful polytopes and graphs ⋮ Bounds on the total restrained domination number of a graph ⋮ Lower connectivities of regular graphs with small diameter ⋮ Restricted domination in graphs with minimum degree 2 ⋮ On the connectivity of cages with girth five, six and eight ⋮ Total restrained domination in trees ⋮ Graphs with small boundary ⋮ Subdivision extendibility ⋮ Partitions of graphs into cographs ⋮ On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles ⋮ Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) ⋮ Forbidden induced subgraphs for near perfect matchings ⋮ On bi-regular cages of even girth at least 8 ⋮ On the order of graphs with a given girth pair ⋮ Forbidden induced subgraphs for star-free graphs ⋮ Generalized pancyclic properties in claw-free graphs ⋮ New results on EX graphs ⋮ Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs ⋮ Graphs with maximum size and lower bounded girth ⋮ Radial Moore graphs of radius three ⋮ On incentive compatible competitive selection protocols ⋮ Some results on decomposable and reducible graph properties ⋮ The edge spectrum of the saturation number for small paths ⋮ Locating pairs of vertices on Hamiltonian cycles ⋮ Monotonicity of the order of \((D;g)\)-cages ⋮ Colorful associahedra and cyclohedra ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter-girth sufficient conditions for optimal extraconnectivity in graphs ⋮ Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling ⋮ Total domination in partitioned trees and partitioned graphs with minimum degree two ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ The spectra of Manhattan street networks ⋮ Connectivity measures in matched sum graphs ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ Edge fault tolerance analysis of super \(k\)-restricted connected networks ⋮ \(H\)-supermagic labelings of graphs ⋮ Kernels by monochromatic paths in digraphs with covering number 2 ⋮ Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian ⋮ On the connectivity and superconnected graphs with small diameter ⋮ Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size ⋮ Some special minimum \(k\)-geodetically connected graphs ⋮ Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ New families of graphs without short cycles and large size ⋮ The graphicahedron ⋮ Lower negative decision number in a graph ⋮ A new bound for the connectivity of cages ⋮ The distribution of the relative arc density of a family of interval catch digraph based on uniform data ⋮ Extension of one-dimensional proximity regions to higher dimensions ⋮ Isomorphism conditions for Cayley graphs of rectangular groups ⋮ The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ On the girth of extremal graphs without shortest cycles ⋮ Balanced decomposition of a vertex-colored graph ⋮ Diameter-sufficient conditions for a graph to be super-restricted connected ⋮ Note on \(E\)-super vertex magic graphs ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs ⋮ Witness rectangle graphs ⋮ 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected ⋮ Some bistar bipartite Ramsey numbers ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ Pancyclic graphs and linear forests ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Constructions of bi-regular cages ⋮ Powerful alliances in graphs ⋮ Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Superconnectivity of regular graphs with small diameter ⋮ On the 3-restricted edge connectivity of permutation graphs ⋮ Inducing regulation of any digraphs ⋮ Degree sequence conditions for maximally edge-connected oriented graphs ⋮ Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter ⋮ Disjoint Hamiltonian cycles in bipartite graphs ⋮ The generalized hierarchical product of graphs ⋮ Inverse degree and edge-connectivity ⋮ Total domination in partitioned graphs ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ On transitive Cayley graphs of strong semilattices of right (left) groups

This page was built for publication: