maximum cardinality
Hybrid bases in graphs
... g7 Hybrid bases of maximum cardinality The concept of hybrid bases of maximum cardinality is clearly related to several important notions in hybrid orientated graph theory.. For example,[r] ...
31
Cost Effective Domination in the Join, Corona and Composition of Graphs
... minimum cardinality of a cost effective dominating set is the cost effective domination number of ...The maximum cardinality of a cost effective dominating set is the upper cost effective domination ...
21
International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph
... Let = ( , ) be a connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of . The upper total edge ...
6
The Upper Total Edge Domination Number of a Graph
... The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of . The upper total edge domination number ( ) of is the ...
6
On The Upper Open Geodetic Domination Number of a Graph
... Proof. Let ∈ ( ) and deg( ) = 1. Let S be a minimal open geodetic dominatingset of − with maximum cardinality, so ( − ) =| |. Since deg( ) = 1, is an end vertex and is adjacent to exactly one vertex, say . ...
11
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs
... the cardinality order ‘≤’ (Bienvenu, Bourgaux, and Goasdou´e ...larger cardinality are preferred over ones of smaller cardi- nality (without looking at inclusion-wise relationships be- tween the selections: ...
8
The Split Majority Domination Number of a Graph
... minimum cardinality of minimal dominating set is called the domination number of a graph G and it is denoted by γ ...minimum cardinality of a maximal independent set is called the lower independence number ...
10
The upper connected vertex detour monophonic number of a graph
... detour monophonic set. The upper x-detour monophonic number, denoted by dm + x (G), is defined as the maximum cardinality of a minimal x-detour monophonic set of G. The concept of vertex detour set has ...
15
INDEPENDENTLY SATURATED GRAPHS
... The cardinality of a maximum size independent set in G is called the independence (or stability) number (or coefficient of internal stability [1]) of G and is denoted by ...The maximum stable set ...
7
The domination parameters of cubic graphs
... minimum cardinality taken over all maximal irredundant sets of G, and the upper irredundance number IR(G) is the maximum cardinality of a (maximal) irredundant set of ...
11
On the Matrix and Additive Communication Channels
... Considerations analogous in the preceding example let us establish the following facts. The matrix channel G consisting of all possible products of the elements M i 1 ⋅ M i 2 ⋅ ⋅ M ik of the set M is a group one. ...
15
Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time
... the maximum cardinality matching is hard: There is a conditional lower bound that shows that no (deterministic or randomized) algorithm can achieve at the same time an amortized update time of O(m 1/2−ε ) ...
15
Advances in the Theory of Determinantal Point Processes
... Before we move on, we will spend a short time investigating determinantal point processes over a finite set whose kernel is an exchangeable matrix. Because all of the individual elements of the ground set are not ...
79
Maximization of Spreading Code Cardinality Using Transpose Function in Synchronous Optical CDMA
... in [13]. It is demonstrated that the SE of an OCDMA system with coherent sources is at least a factor of five higher than systems with incoherent sources. On the other hand, becomes the most important parameter of the ...
6
Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
... and maximum matching cardinality are characterized by Dutton and Klostermeyer [9] while Yannakakis and Gavril [17] have shown that edge dominating set problem is NP complete even when restricted to planar ...
5
Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse
... The cardinality of a column is the number of distinct values in the ...the cardinality of an indexed column is low or high since an indexing technique may work efficiently only with either low ...
5
Determination of Topological Bond Orders of Phenanthrene Molecule Using Its Cardinality
... Topological indices are uniquely determined numerical quantities that are used to correlate the molecular properties with the structure of the molecule. During its determination connectivity of graph is important not the ...
6
Nonnilpotent subsets in the Suzuki groups
... edge. It follows that the nonnilpotent graphs of weakly nilpotent groups with the same cardinality are isomorphic. So we must be interested in non weakly nilpotent groups. A set C of vertices of a graph Λ whose ...
9
Vol 6, No 6 (2015)
... In this paper we follow the notations of [3]. As usual n = |V | and m = |E| denote the number of vertices and edges of a graph G respectively. The graphs considered here are undirected and non complete. For any graph G= ...
5
HPB: A Model for Handling BN Nodes with High Cardinality Parents
... the maximum number of parents is limited to one (the class node is the only parent of any other ...the maximum number of parent nodes to two. However, limiting the maximum number of parents also ...
30