Graphoidal Length and Graphoidal Covering Number of a Graph

2017 ◽  
pp. 305-311
Author(s):  
Purnima Gupta ◽  
Rajesh Singh ◽  
S. Arumugam
Keyword(s):  
Covering Number

scholarly journals Uniform intersecting families with covering number four

1995 ◽  
Vol 71 (1) ◽  
pp. 127-145 ◽  
Author(s):  
Peter Frankl ◽  
Katsuhiro Ota ◽  
Norihide Tokushige
Keyword(s):  
Covering Number ◽  
Intersecting Families

scholarly journals The geodetic vertex covering number of a graph

2020 ◽  
Vol 8 (2) ◽  
pp. 683-689
Author(s):  
V.M. Arul Flower Mary ◽  
J. Anne Mary Leema ◽  
P. Titus ◽  
B. Uma Devi
Keyword(s):  
Covering Number ◽  
Vertex Covering

scholarly journals Investigating Numeric Relationships Using an Interactive Tool: Covering Number Sense Concepts for the Middle Grades

2010 ◽  
Vol 01 (02) ◽  
pp. 121-127
Author(s):  
Hui Fang Huang “Angie” Su ◽  
Carol A. Marinas ◽  
Joseph M. Furner
Keyword(s):  
Middle Grades ◽  
Number Sense ◽  
Covering Number ◽  
Interactive Tool

scholarly journals Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3

2013 ◽  
Vol 313 (13) ◽  
pp. 1464-1474 ◽  
Author(s):  
Hortensia Galeana-Sánchez ◽  
Mika Olsen
Keyword(s):  
Covering Number

scholarly journals Graphs whose acyclic graphoidal covering number is one less than its maximum degree

2001 ◽  
Vol 240 (1-3) ◽  
pp. 231-237 ◽  
Author(s):  
S. Arumugam ◽  
I. Rajasingh ◽  
P.R.L. Pushpam
Keyword(s):  
Maximum Degree ◽  
Covering Number

On the multifractal analysis of the covering number on the Galton–Watson tree

2019 ◽  
Vol 56 (01) ◽  
pp. 265-281
Author(s):  
Najmeddine Attia
Keyword(s):  
Hausdorff Dimension ◽  
Multifractal Analysis ◽  
Covering Number

AbstractWe consider, for t in the boundary of a Galton–Watson tree $(\partial \textsf{T})$, the covering number $(\textsf{N}_n(t))$ by the generation-n cylinder. For a suitable set I and sequence (sn), we almost surely establish the Hausdorff dimension of the set $\{ t \in \partial {\textsf{T}}:{{\textsf{N}}_n}(t) - nb \ {\sim} \ {s_n}\} $ for b ∈ I.

scholarly journals On the König deficiency of zero-reducible graphs

2019 ◽  
Vol 39 (1) ◽  
pp. 273-292
Author(s):  
Miklós Bartha ◽  
Miklós Krész
Keyword(s):  
Perfect Matching ◽  
Linear Time ◽  
Perfect Matchings ◽  
Covering Number ◽  
Matching Number ◽  
Empty Graph ◽  
Reduction System ◽  
Vertex Covering ◽  
Np Complete ◽  
The Difference

Abstract A confluent and terminating reduction system is introduced for graphs, which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost linear time. The König property is investigated in the context of reduction by introducing the König deficiency of a graph G as the difference between the vertex covering number and the matching number of G. It is shown that the problem of finding the König deficiency of a graph is NP-complete even if we know that the graph reduces to the empty graph. Finally, the König deficiency of graphs G having a vertex v such that $$G-v$$G-v has a unique perfect matching is studied in connection with reduction.

Average covering number for some graphs

2019 ◽  
Vol 53 (1) ◽  
pp. 261-268
Author(s):  
D. Doğan Durgun ◽  
Ali Bagatarhan
Keyword(s):  
Interconnection Networks ◽  
Undirected Graph ◽  
Cartesian Product ◽  
Covering Number ◽  
Minimum Cardinality ◽  
Covering Numbers ◽  
Covering Set ◽  
Local Covering

The interconnection networks are modeled by means of graphs to determine the reliability and vulnerability. There are lots of parameters that are used to determine vulnerability. The average covering number is one of them which is denoted by $ \overline{\beta }(G)$, where G is simple, connected and undirected graph of order n ≥ 2. In a graph G = (V(G), E(G)) a subset $ {S}_v\subseteq V(G)$ of vertices is called a cover set of G with respect to v or a local covering set of vertex v, if each edge of the graph is incident to at least one vertex of Sv. The local covering number with respect to v is the minimum cardinality of among the Sv sets and denoted by βv. The average covering number of a graph G is defined as β̅(G) = 1/|v(G)| ∑ν∈v(G)βν In this paper, the average covering numbers of kth power of a cycle $ {C}_n^k$ and Pn □ Pm, Pn □ Cm, cartesian product of Pn and Pm, cartesian product of Pn and Cm are given, respectively.

scholarly journals Properties of ideals on the generalized Cantor spaces

2001 ◽  
Vol 66 (3) ◽  
pp. 1303-1320 ◽  
Author(s):  
Jan Kraszewski
Keyword(s):  
Covering Number ◽  
Cantor Space ◽  
Image Position ◽  
Cantor Spaces

AbstractWe define a class of productiveσ-ideals of subsets of the Cantor space 2ω and observe that both σ-ideals of meagre sets and of null sets are in this class. From every productive σ-ideal we produce a σ-ideal of subsets of the generalized Cantor space 2κ. In particular, starting from meagre sets and null sets in 2ω we obtain meagre sets and null sets in 2ω, respectively. Then we investigate additivity, covering number, uniformity and cofinality of . For example, we show thatOur results generalizes those from [5].

Sign in / Sign up

Export Citation Format

Share Document