On the distribution of the domination number for random class cover catch digraphs

DOI10.1016/S0167-7152(01)00129-8MaRDI QIDQ158221zbMATH OpenOpenAlexFDO

Authors Carey E. Priebe, Jason G. Devinney, David J. Marchette, Jason DeVinney, Carey E. Priebe, David J. Marchette

Publication date December 2001

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-7152(01)00129-8

zbMATH Keywords

distributiondomination numberintersection digraphsrandom interval catch digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 2077689
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• A SLLN for a one-dimensional class cover problem

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 739019 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3354425 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A characterization of interval catch digraphs
• Algorithms for interval catch digraphs
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Approximation algorithms for combinatorial problems
• Approximation algorithms for the class cover problem
• Inequalities for minimal covering sets in set systems of given rank
• Interval digraphs: An analogue of interval graphs
• On Random Intersection Graphs: The Subgraph Problem
• Sphere-of-attraction graphs
• Topics in Intersection Graph Theory

Cited in

(22)

• Comparison of relative density of two random geometric digraph families in testing spatial clustering
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• Edge density of new graph types based on a random digraph family
• The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
• Classification using proximity catch digraphs
• Characterizing the scale dimension of a high-dimensional classification problem
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• scientific article; zbMATH DE number 2077689 (Why is no real title available?)
• A general SLLN for the one-dimensional class cover problem
• A new family of random graphs for testing spatial segregation
• A SLLN for a one-dimensional class cover problem
• Domination number of an interval catch digraph family and its use for testing uniformity
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Extension of one-dimensional proximity regions to higher dimensions
• On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
• A new family of proximity graphs: class cover catch digraphs
• Spatial clustering tests based on the domination number of a new random digraph family
• A CLT for a one-dimensional class cover problem
• rcccd
• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

This page was built for publication: On the distribution of the domination number for random class cover catch digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q158221)