scientific article; zbMATH DE number 3358515
From MaRDI portal
Publication:5632603
zbMath0226.05121MaRDI QIDQ5632603
Charles Payan, François Jaeger
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (57)
Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Nordhaus-Gaddum problems for power domination ⋮ Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates ⋮ Some parameters of graph and its complement ⋮ On the domination number of a graph and its block graph ⋮ On $f$-domination number of a graph ⋮ Unnamed Item ⋮ The diversity of domination ⋮ On the domination number of cross products of graphs ⋮ On the product of upper irredundance numbers of a graph and its complement ⋮ Unnamed Item ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ Inequalities of Nordhaus-Gaddum type for doubly connected domination number ⋮ A Nordhaus-Gaddum-type result for the induced path number ⋮ Laplacian distribution and domination ⋮ Domination in 4-regular graphs with girth 3 ⋮ Domination parameters of a graph and its complement ⋮ Nordhaus–Gaddum problem in terms of G-free coloring ⋮ Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement ⋮ Domination in commuting graph and its complement ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs ⋮ Disjunctive total domination in permutation graphs ⋮ Contributions to the theory of domination, independence and irredundance in graphs ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ On the non-cyclic graph of a group ⋮ Unnamed Item ⋮ On generalised minimal domination parameters for paths ⋮ The product of the restrained domination numbers of a graph and its complement ⋮ Connected domination number of a graph and its complement ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Total restrained domination in graphs ⋮ The product of the independent domination numbers of a graph and its complement ⋮ Unnamed Item ⋮ Distance magic labeling and two products of graphs ⋮ On Cartesian products having a minimum dominating set that is a box or a stairway ⋮ Certified domination ⋮ Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs ⋮ Towards a theory of domination in graphs ⋮ Outer independent double Roman domination ⋮ Paired-domination number of a graph and its complement ⋮ On total restrained domination in graphs ⋮ Unnamed Item ⋮ Domination and Spectral Graph Theory ⋮ Restrained and Total Restrained Domination in Graphs ⋮ Distance Domination in Graphs ⋮ More on limited packings in graphs ⋮ Restrained domination in graphs ⋮ On the domination and signed domination numbers of zero-divisor graph ⋮ On the domination number of a graph and its total graph ⋮ Relations between parameters of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ On the domination number of a graph and its shadow graph ⋮ The domatic number problem ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
This page was built for publication:
