Results 21 to 30 of about 2,253,480 (276)
On total directed graphs of non-commutative rings
For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
On the genus of some total graphs
Let be a commutative ring with a proper ideal . A generalization of total graph is introduced and investigated. It is the (undirected) graph with all elements of as vertices, that two distinct vertices are adjacent if and only if where for some and is a ...
L. Hamidian Jahromi, A. Abbasi
doaj +1 more source
F index of graphs based on four new operations related to the strong product
For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
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
For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u,
N. Dehgardi +2 more
doaj +1 more source
Total Roman reinforcement in graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahangar H. Abdollahzadeh +4 more
openaire +3 more sources
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
Total [1,2]-domination in Graphs
17 ...
Lv, Xue-Zheng, Wu, Baoyindureng
openaire +2 more sources
Total Domination in Partitioned Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frendrup, Allan +2 more
openaire +3 more sources

