Relations between packing and covering numbers of a tree
From MaRDI portal
Publication:1220937
DOI10.2140/pjm.1975.61.225zbMath0315.05102OpenAlexW1974110893MaRDI QIDQ1220937
Publication date: 1975
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1975.61.225
Related Items (only showing first 100 items - show all)
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs ⋮ Vector representation of graph domination ⋮ A new approach on locally checkable problems ⋮ A recurrence template for several parameters in series-parallel graphs ⋮ Regular codes in regular graphs are difficult ⋮ Amnesiac flooding: synchronous stateless information dissemination ⋮ On the domination of the products of graphs II: Trees ⋮ Packing and Covering Constants for Certain Families of Trees. II ⋮ Guarding polyominoes, polycubes and polyhypercubes ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ Graphs with unique maximum packing of closed neighborhoods ⋮ Total protection of lexicographic product graphs ⋮ An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ On the perfect differential of a graph ⋮ New results about the bondage number of a graph ⋮ Unnamed Item ⋮ Mengerian properties, hamiltonicity, and claw‐free graphs ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Paired domination versus domination and packing number in graphs ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Analytical models for locating undesirable facilities ⋮ Exponential independence ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Least domination in a graph ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Matchings and transversals in hypergraphs, domination and independence in trees ⋮ A PTAS for the sparsest 2-spanner of 4-connected planar triangulations ⋮ Universal maximal packing functions of graphs ⋮ Prime factorization and domination in the hierarchical product of graphs ⋮ Distance domination in graphs with given minimum and maximum degree ⋮ Broadcast domination and multipacking in strongly chordal graphs ⋮ Covering, Packing and Generalized Perfection ⋮ Bounds on the burning number ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Bondage number of strong product of two paths ⋮ (Open) packing number of some graph products ⋮ Limited Packings in Graphs ⋮ Extremal values on Zagreb indices of trees with given distance \(k\)-domination number ⋮ Disjunctive total domination in permutation graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ A self-stabilizing algorithm to maximal 2-packing with improved complexity ⋮ Dominating sets, packings, and the maximum degree ⋮ On bondage numbers of graphs: a survey with some comments ⋮ New bounds for the broadcast domination number of a graph ⋮ The discrete p-dispersion problem ⋮ Efficient \(k\)-distance dominating set in Cayley graphs ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Locational analysis ⋮ Optimal \((t, r)\) broadcasts on the infinite grid ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On hypercube packings, blocking sets and a covering problem ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ Average eccentricity, \(k\)-packing and \(k\)-domination in graphs ⋮ On packing and covering numbers of graphs ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree ⋮ Independent sets in graphs ⋮ On the \(r\)-domination number of a graph ⋮ Distance 2-domination in prisms of graphs ⋮ On the number of 2-packings in a connected graph ⋮ Eigenvalues and separation in graphs ⋮ Dominating set games. ⋮ Average distance and generalised packing in graphs ⋮ Critical concepts in domination ⋮ A GENERAL POSITION PROBLEM IN GRAPH THEORY ⋮ On the broadcast domination number of permutation graphs ⋮ The bondage number of the strong product of a complete graph with a path and a special starlike tree ⋮ A survey of selected recent results on total domination in graphs ⋮ Tightness of domination inequalities for direct product graphs ⋮ Packing and covering constants for certain families of trees. I ⋮ On the 2-packing differential of a graph ⋮ Domination subdivision numbers of trees ⋮ On the packing numbers in graphs ⋮ Broadcast Domination in Graphs ⋮ Domination in Digraphs ⋮ Connected Domination ⋮ Distance Domination in Graphs ⋮ Powerful alliances in graphs ⋮ On the ratios between packing and domination parameters of a graph ⋮ Average distances and distance domination numbers ⋮ OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS ⋮ Strong non split r-domination number of a graph ⋮ Vizing's conjecture: a survey and recent results ⋮ Geodesic visibility in graphs ⋮ Packing and domination parameters in digraphs ⋮ More on limited packings in graphs ⋮ Extremal multiplicative Zagreb indices among trees with given distance k-domination number ⋮ A new lower bound on the domination number of a graph ⋮ Packing in trees ⋮ Interpolation theorems for domination numbers of a graph ⋮ A review of random graphs ⋮ The probabilistic approach to limited packings in graphs ⋮ A lower bound for the distance \(k\)-domination number of trees ⋮ Generalized limited packings of some graphs with a limited number of \(P_4\)-partners ⋮ Paired-domination of Cartesian products of graphs and rainbow domination ⋮ Orientable domination in product-like graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The k-neighbor domination problem ⋮ On \(m\)-centers in \(P_ t\)-free graphs ⋮ Vertex cover at distance on \(H\)-free graphs ⋮ Further results on packing related parameters in graphs
This page was built for publication: Relations between packing and covering numbers of a tree
