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

DOI10.1016/s0167-7152(01)00129-8zbMath0999.05082OpenAlexW2117772622MaRDI QIDQ158221

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

Publication date: December 2001

Published in: Statistics & Probability Letters, 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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of interval catch digraphs
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Approximation algorithms for combinatorial problems
• Algorithms for interval catch digraphs
• Inequalities for minimal covering sets in set systems of given rank
• Approximation algorithms for the class cover problem
• Interval digraphs: An analogue of interval graphs
• A Greedy Heuristic for the Set-Covering Problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Topics in Intersection Graph Theory
• On Random Intersection Graphs: The Subgraph Problem