and lexicographic product
Introduction to Cartesian, Tensor and Lexicographic Product of Bipolar Interval Valued Fuzzy Graph
... Cartesian product, tensor product and lexicographic product of two bipolar interval valued of fuzzy graphs also we can generalized it to like strong product, week ...
5
Strong Dominating Sets of Lexicographic Product Graph of Cayley Graphs with Arithmetic Graphs
... of lexicographic product the vertex is adjacent with the vertex in Thus all the vertices in are adjacent with at least one vertex in and becomes a dominating set of ...
5
Adjacent Vertex Distinguishing Edge colorings of the Lexicographic Product of Special Graphs
... Corollary 2.4 If H is bipartite graph of order m ≥ 3 , then χ as ′ ( G [ H ]) = ( n − 1 ) m + 3 . From the definition of lexicographic product, for two graphs G and H , equation G [ H ] ≅ H [ G ] is ...
6
Some properties on the lexicographic product of graphs obtained by monogenic semigroups
... In [, Theorem .], the authors proved that the clique number is preserved under the lexicographic product for any graphs G and H. In the following, we deal with this result by considering our special ...
9
Graph Invariants of Deleted Lexicographic Product of Graphs
... The lexicographic product was studied first by Felix Hausdorff in 1914 [9] and then studied by Harary and Sabidussi. Feigenbaum and Schäffer [5] proved that the complexity of testing whether an arbitrary ...
11
Bondage Number of Lexicographic Product of Two Graphs
... the lexicographic product G[H] has vertex set {(g, h) : g ∈ V (G), h ∈ V (H)} and two vertices (g, h), (g', h' ) are adjacent if and only if either [ g, g' ] is an edge of G or g = g' and [ h, h' ] is an ...
6
Forcing Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs
... Abstract. In this paper, the connected dominating sets and total dominating sets in the lex- icographic product of two graphs are characterized. Further, the connected domination, total domination, forcing ...
8
On Semitotal Domination in Graphs
... The lexicographic product or composition G[H] of G and H is the graph with V (G[H]) = V (G) × V (H) and (u, v)(u 0 , v 0 ) ∈ E(G[H]) if and only if either uu 0 ∈ E(G) or u = u 0 and vv 0 ∈ ...
16
Total Partial Domination in Graphs Under Some Binary Operations
... corona, lexicographic product and Cartesian prod- uct of graphs and determined the exact values or sharp bounds of the corresponding partial domination number of these ...
13
On Lexicographic Products of Two Fuzzy Graphs
... = ∑ µ = ∑ µ . G′:(σ′, µ′) is called a spanning fuzzy sub graph of G:(σ, µ) if σ = σ′ and µ′ ⊆ µ, that is, if σ (u)=σ′(u) for every u∈V and µ′(e)≤ µ(e) for every e∈E. The lexicographic product of G 1 :(V 1 ...
8
On lexicographic products of two intuitionistic fuzzy graphs
... of lexicographic products of two intuitionistic fuzzy graphs namely, lexicographic min product and lexicographic max product which are analogous to the concept lexicographic ...
14
Vertex Distance Complement Spectra of Some Graphs
... Cartesian product, double graph, lexicographic product, double odd graph and extended double cover ...Cartesian product of a graph G with K 2 and the ...
12
STATUS CONNECTIVITY INDICES OF CARTESIAN PRODUCT OF GRAPHS
... Graph theory has successfully provided chemists with a variety of useful tools [4, 9, 11, 12], among which are the topological indices. In theoretical chemistry, assigning a numerical value to the molecular structure ...
8
Impact of cryogenic cooling during machining: A Literature Review
... Theorem 3.3. If G is a graph of order m and having at most one vertex of degree m −1 then b(P4[G]) = m + 1. Proof. Let G be a graph of order m and having at most one vertex, say, v1 of degree m −1. The ...
7
Reasoning with Dependency Structures and Lexicographic Definitions Using Unit Graphs
... Most past or current projects that aimed at im- plementing the ECD did so in a lexicographic perspective. One important example is the RE- LIEF project (Lux-Pogodalla and Polgu`ere, 2011), which aims at ...
10
Producing LRs in Parallel with Lexicographic Description: the DCC project
... the product between frequency and dispersion index (an index between 0 and 1, indicating the distribution of a given lemma through the different parts of the ...
6
How to Evaluate and Raise the Quality in a Collaborative Lexicographic Approach
... The paper studies different aspects related to collaborative approaches dedicated to lexicography, in the context of a project aiming to build one of the biggest digital dictionaries in the world. The setting is that of ...
5
Applications of Lexicographic Semirings to Problems in Speech and Language Processing
... the lexicographic semirings for the two tasks (the tagging task and the subsequent determinization of the tagged lattice) involve determinization with respect to different ...cross product of the two types ...
30
Fuzzy Critical Path Method Based on Lexicographic Ordering
... computed lexicographic ordering rank of total fuzzy slack time for each path in fuzzy project network to find the critical path in a fuzzy project ...the Lexicographic ordering is simple in evaluation and ...
16
Semicontinuity and closedness of parametric generalized lexicographic quasiequilibrium problems
... This is a total (called also linear) order, i.e., any pair of elements is comparable. In [], it was shown that, for a fixed orthogonal base, the lexicographic order is the unique total order. We will see later ...
14