Simple graph
The Swallow-tail Plot: a Simple Graph for Visualizing Bivariate Data
... We connect by means of a segment the point of the unit presenting the minimum (maximum) on a line with its point on the other line. If the two min (max) correspond to different units, there are two segments for the min ...
10
On construction of some new types of semigroups
... commuting graph of a finite non-commutative semigroup is a simple graph whose sets of vertices are from S − Z(S) and whose sets of edges are the elements of S which commute with other elements ...
9
Properties of extended ideal based zero divisor graph of a commutative ring
... divisor graph of a ring R, denoted by Γ(R), is the simple graph associated to R such that its vertex set consists of all its nonzero divisors and that two distinct vertices are joined by an edge if ...
5
ON K-ECCENTRIC INDICES AND K HYPER- ECCENTRIC INDICES OF GRAPHS.
... a graph with | | | | ...line graph of G. The vertices and edges of a graph are called the elements of ...line graph of an undirected graph G is another graph L(G) that represents ...
12
On large arbitrary left path within a semigroup
... given graph G. Let S be a finite non-commutative semigroup, its commuting graph, denoted by G(S), is a simple graph (which has no loops and multiple edges) whose sets of vertices are elements ...
8
Finite Simple Graphs and Their Associated Graph Lattices
... (simple) graph is an ordered pair G = (G, E) where G is a finite nonempty set whose elements are called vertices and E is a set of two-element subsets of G whose elements are called ...
21
Vol 9, No 5 (2018)
... connected simple graph. An edge colouring of a graph G is a function 𝑓: 𝐸(𝐺) → 𝐶, where C is a set of distinct ...petersen graph of type ...
7
Groups for which the noncommuting graph is a split graph
... noncommuting graph ∇ (G) of a group G is a simple graph whose vertex set is the set of noncentral elements of G and the edges of which are the ones connecting two noncommuting ...noncommuting ...
7
Modeling of Prey Predator Problem by a Graph Dierential Equation
... pseudo simple graph, product of two graphs and obtain a sufficient condition which will guarantee that the solution of the IVP of a graph differential equation has the same nature as its graph ...
8
Computing Chemical Properties of Molecules by Graphs and Rank Polynomials
... a simple graph with the vertex and edge sets V and E, ...The graph theory has successfully provided chemists with a variety of very useful tools, namely, counting ...the graph is connected ...
7
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
... where K is the maximal normal solvable subgroup of G. Also, t(S) ≥ t(G) − 1 and t(2, S) ≥ t(2, G) by Lemma 2.1. Therefore t(S) ≥ 13 and t(2, S) ≥ 2. On the other hand, by [19, Tables 2, 9], if S is isomorphic to a ...
7
climate graphs
... Climate graphs are used to illustrate the average temperature and rainfall experienced at a particular place over the course of a year. The graphs consist of a red line graph showing average monthly temperature, ...
5
SRDF: Extracting Lexical Knowledge Graph for Preserving Sentence Meaning
... knowledge graph from unstructured ...knowledge graph. Not only does SRDF knowledge graph (KG) reflect the dependency structure of a sentence but can also be used in a variety of semantic web ...
5
On multiplicity of quadrilaterals in Complete graphs
... For any simple connected graph G, the Ramsey number rG is defined as the smallest positive integer N such that every 2-coloring of the edges of the complete graph KN must contain a monoc[r] ...
12
Regular number of line block graph of a graph
... is the minimum cardinality of total dominating set of . A set with minimum cardinality among all the maximal is called minimum independent . The cardinality of a minimum independent dominating set is called independent ...
6
Machine Translation from English to Tamil using Hybrid Technique
... namely simple present, simple past, simple future, present continuous, past continuous and noun phrase for the purpose of evaluation the translation ...
7
On Reciprocal Complementary Wiener Index of a Graph
... molecular graph. A molecular graph is a representation of the structural formula of a chemical compound in terms of graph theory, whose vertices correspond to the atoms of the compound and edges ...
12
On almost recognizability by spectrum of simple classical groups
... (iv) If r and s are distinct primes from π(L) \{ p } and e(r, q) = e(s, q), then r and s are adjacent in GK(L). Let L be a simple classical group over a field of order q and characteristic p. For σ ⊆ π(L) \ { p } ...
27
On the generating graph of a simple group
... The generating graph Γ(H) of a finite group H is a graph whose vertices are the elements of H, where two vertices are adjacent if they generate H. Examples show that little information about H can be ...
12
Optimization of Fink and Howe Trusses
... Since design variable is considered to be continuous, even though it is discrete by nature. Hence A-R curve is used to find the values of minimum radius of gyration for any given value of area. The following equation is ...
9