Results 31 to 40 of about 8,236,191 (249)
Let N be a right near-ring. Let Z(N) be the set of right zero-divisors of N.We dene total near-ring graph of N as a graph whose vertex set is the set of allelements of the near-ring N and any two distinct vertices n1; n2 2 N are adjacentif and only if n1
Moytri Sarmah
doaj +1 more source
Total Domination on Some Graph Operators
Let G=(V,E) be a graph; a set D⊆V is a total dominating set if every vertex v∈V has, at least, one neighbor in D. The total domination number γt(G) is the minimum cardinality among all total dominating sets.
José M. Sigarreta
doaj +1 more source
TOTAL CHROMATIC NUMBER OF FUZZY BISTAR GRAPH & FUZZY HELM GRAPH
Fuzzy total chromatic number is the least value of k such that k-fuzzy total coloring exist. In this paper, we discussed the concept of total coloring of graphs to Fuzzy bistar graph and Fuzzy helm graph.
A.Marydayana, A.Deebamonica
core +1 more source
Towards a Maude tool for model checking temporal graph properties [PDF]
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
Weak Domination In semi total Block graph
weak domination in Semi total Block graph, Domination number in graph ...
sana Aejaz (16545906)
core +1 more source
Pragmatic Graph Rewriting Modifications [PDF]
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
A study of the total graph in genetic code algebra [PDF]
Suppose R be a commutative ring and Z(R) its set of zero-divisors. Total graph is the (undirected) graph where set of all elements of R is taken as the vertex set and two vertices say x and y (x not equals to y) in R are adjacent if and only if their sum
Birinchi Kumar Boruah, Tazid Ali
doaj
The total irregularity of a graph [PDF]
Graph ...
Hosam Abdo, Stephan Brandt, D. Dimitrov
doaj +1 more source
New results of partially total fuzzy graph
Objective The study of total fuzzy graphs in all cases is crucial for the development of both theories and applications of the graph theory. Without theory the application will not be developed.
Fekadu Tesgera Agama +2 more
doaj +1 more source
Isolation Number of Transition Graphs
Let G=(V,E) be a graph and F be a family of graphs; a subset (S⊆V(G)) is said to be an F-isolating set if G[V(G)∖NG[S]] does not contain F as a subgraph for all F∈F.
Junhao Qu, Shumin Zhang
doaj +1 more source

