Results 41 to 50 of about 732,396 (308)
Journal of Algebraic SystemsLet 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
Discrete Mathematics, 2002 A set \(S\) of vertices in a graph \(G\) is called a total irredundant set, if for each vertex \(v\) in \(G\) either \(v\) or one of its neighbours has no neighbour in \(S\setminus \{ v\}\). The authors study the minimum cardinality \(\text{ir}_t(G)\) and the maximum cardinality \(\text{IR}_t(G)\) of maximal irredundant sets in \(G\). They determine \(\
Odile Favaron +4 more
openaire +3 more sources
A characterization of total graphs [PDF]
Proceedings of the American Mathematical Society, 1970 We consider “ordinary” graphs; that is, finite undirected graphs with no loops or multiple edges. The total graph T (
openaire +2 more sources
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
, 2013 We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core +1 more source
Weak Domination In semi total Block graph [PDF]
, 2023 weak domination in Semi total Block graph, Domination number in graph ...
sana Aejaz (16545906)
core +1 more source
Entire choosability of near-outerplane graphs [PDF]
, 2008 It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington +2 more
core +1 more source
A study of the total graph in genetic code algebra [PDF]
Network Biology, 2022 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
Totally antimagic total graphs. [PDF]
Australas. J Comb., 2015 For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge.
Bača, Martin +5 more
openaire +1 more source
Discrete Mathematics, 1997 Let \(G=(V,E)\) be a connected graph. The elements of the set \(V(G)\cup E(G)\) are called elements of \(G\). A set \(M\) of elements of \(G\) is called a total matching if the elements of \(M\) are pairwise independent, and \(G\) is totally equimatchable if every maximal total matching of \(G\) is maximum.
Jerzy Topp, Preben D. Vestergaard
openaire +3 more sources
Verifying Total Correctness of Graph Programs [PDF]
, 2012 GP 2 is an experimental nondeterministic programming language based on graph transformation rules, allowing for visual programming and the solving of graph problems at a high-level of abstraction.
Poskitt, Christopher M. +2 more
core +2 more sources