scientific article; zbMATH DE number 1055145
From MaRDI portal
Publication:4350166
chemistrycombinatoricscomputer sciencediscrete mathematicsdominationextremal graph theorygraph decompositiongraph labelingsgraph theoryprobabilistic methodvoltage graphsvulnerability
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99) Graph theory (05Cxx)
Recommendations
Cited in
(only showing first 100 items - show all)- Balanced decomposition of a vertex-colored graph
- Diameter-sufficient conditions for a graph to be super-restricted connected
- 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
- 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
- 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
- Minus domination in graphs
- On perfect neighborhood sets in graphs
- Some general aspects of the framing number of a digraph
- Nordhaus--Gaddum bounds for independent domination
- Splitting and contractible edges in 4-connected 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
- On upper domination Ramsey numbers for graphs.
- Automorphism groups of k-arc transitive covers.
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Bipartite rainbow Ramsey numbers.
- Cycles within specified distance from each vertex.
- Algorithms and obstructions for linear-width and related search parameters
- On the distribution of the domination number for random class cover catch digraphs
- Packing in trees
- Toughness and the existence of \(k\)-factors. III
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
- Directed graphs and combinatorial properties of semigroups
- Extremal irregular digraphs
- On \((\mathrm{K}_t-e)\)-saturated graphs
- Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors
- On simple graphs arising from exponential congruences
- A note on internally disjoint alternating paths in bipartite graphs
- On arc-regular permutation groups using Latin squares
- Identity orientation of complete bipartite graphs
- Cuts leaving components of given minimum order
- De Bruijn and Kautz digraphs of a rooted tree
- Altitude of regular graphs with girth at least five
- 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 '-optimality in graphs of diameter 2
- Characterizing the scale dimension of a high-dimensional classification problem
- Intervals and steps in a connected graph
- Neighborhood and degree conditions for super-edge-connected bipartite digraphs
- Stratification and domination in graphs. II
- Edge-connectivity in \(P_k\)-path graphs
- The poset on connected induced subgraphs of a graph need not be Sperner
- Degree sequences and the existence of k-factors
- A Nordhaus-Gaddum-type result for the induced path number
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
- On second order degree of graphs
- Forbidden induced subgraphs for perfect matchings
- Chordality and 2-factors in tough graphs
- The geodetic number of an oriented graph
- The \(p\)-restricted edge-connectivity of Kneser graphs
- Some generalized bipartite Ramsey numbers involving short cycles
- Semitotal domination of Harary graphs
- Minimum degree conditions for the strength and bandwidth of graphs
- A note on the crossing numbers of 5-regular graphs
- On the number of weakly connected subdigraphs in random \(k\)NN digraphs
- An algebraic approach to lifts of digraphs
- A new approach to gross error detection for GPS networks
- 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\)
- On a conjecture on the order of cages with a given girth pair
- On polynomial digraphs
- A partitional clustering algorithm validated by a clustering tendency index based on graph theory
- The interval function of a connected graph and road systems
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
- On the connectivity of diamond-free graphs
- A formula for the number of labelled trees
- Note on the connectivity of line graphs
- Iterated endorsement deduction and ranking
- Broadcast domination and multipacking in strongly chordal graphs
- On the order of \((\{r,m\};g)\)-cages of even girth
- On the sign patterns of the smallest signless Laplacian eigenvector
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350166)
