• No results found

Line graph

Mean Degree Based Topological Indices for Rhomtrees and Line Graph of Rhomtrees

Mean Degree Based Topological Indices for Rhomtrees and Line Graph of Rhomtrees

... Rhotrix theory deals with array of numbers in rhomboid mathematical form. The graphical representation of rhotrix of dimension n is known as rhomtree. Since the degree of all the vertices in rhomtree is less than or ...

9

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

... the line graph of the subdivision graph of tadpole graph, wheel and ...the line graph of the subdivision graph of any ...

12

(1): 50 minutes None Whole Class N/A 03.SC.TE TE.2.2 Bar Graph, Graph, Line graph, Pie Graph

(1): 50 minutes None Whole Class N/A 03.SC.TE TE.2.2 Bar Graph, Graph, Line graph, Pie Graph

... Bar Graph – a chart with bars whose lengths represent amounts of various ...2. Graph – a pictorial device used to represent quantitative (numerical) ...3. Line Graph – a diagram of lines made ...

9

Estimating population size via line graph reconstruction

Estimating population size via line graph reconstruction

... We study the complexity of the resulting line graph modification problems. We observe that both problems (edge- and vertex-deletion) are NP-complete and provide polynomial integer programming formulations ...

10

On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n

On the Line Graph of the Complement Graph for the Ring of Gaussian Integers Modulo n

... A graph that contains a Hamiltonian cycle is called a Hamiltonian ...The line graph of a graph G with more than 4 vertices and diameter 2 is Hamiltonian ...

11

TOPOLOGICAL CHARACTERIZATION FOR THE LINE GRAPH OF NANOSTRUCTURES

TOPOLOGICAL CHARACTERIZATION FOR THE LINE GRAPH OF NANOSTRUCTURES

... subdivision graph [23, 24] S(G) is the graph obtained from G by replacing each of its edge by a path of length 2, or equivalently, by inserting an additional vertex into each edge of G, ...The line ...

18

A Novel Molecular Descriptor Derived from Weighted Line Graph

A Novel Molecular Descriptor Derived from Weighted Line Graph

... of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of ...weighted line graph of the molecular structure and applied in correlating the ...

13

A line graph algorithm for clustering chemical structures based on common substructural cores

A line graph algorithm for clustering chemical structures based on common substructural cores

... a line graph interpretation of the proximity graph and on a graph representation of 2D chemical ...a graph-theoretic similarity measure based on the maximum common edge subgraph to ...

12

On Topological Indices of Subdivided and Line Graph of Subdivided Friendship Graph

On Topological Indices of Subdivided and Line Graph of Subdivided Friendship Graph

... of graph structure analysis, certain degree-based topological indices namely atom bond connectivity index, geometric arithmatic index, Randic index, sum connectivity index and augmented Zagreb index for k=1 ...

5

TransLiG: a de novo transcriptome assembler that uses line graph iteration

TransLiG: a de novo transcriptome assembler that uses line graph iteration

... constructing line graphs starting from the splicing graphs. For a graph G = ( V , E ), the line graph L ( G ) of G is the graph with nodes representing edges of G , and edges ...

9

Degree Based Indices of Rhomtrees and Line Graph of Rhomtrees

Degree Based Indices of Rhomtrees and Line Graph of Rhomtrees

... undirected graph. In the field of chemical graph theory and in mathematical chemistry, a topological index, also known as a connectivity index, is a type of a molecular descriptor that is calculated based ...

9

Equitable Coloring Of Prism Graph And Its Central,Middle, Total And Line Graph

Equitable Coloring Of Prism Graph And Its Central,Middle, Total And Line Graph

... condition ||𝑉 | − |𝑉 || ≤ 1 holds for every pair of (𝑖, 𝑗), then G is said to be equitably k-colorable. The smallest integer k for which G is equitably k-colorable is known as Equitable chromatic number of G and it is ...

5

Recurrence Relation for Achromatic Number of Line Graph of Graph

Recurrence Relation for Achromatic Number of Line Graph of Graph

... This has become possible to get two different colour edges at a common vertex of Γ and is ∆ due to bipartition The edges through y, orange and red inside Γ and ∆ are going to be of some [r] ...

6

Line graphs associated to the maximal graph

Line graphs associated to the maximal graph

... maximal graph associated to R, i.e., G(R) is a graph with vertices as the elements of R, where two distinct vertices a and b are adjacent if and only if there is a maximal ideal of R containing ...the ...

11

Some Properties of the Line Graphs Associated to the Total Graph of a Commutative Ring

Some Properties of the Line Graphs Associated to the Total Graph of a Commutative Ring

... determine some properties of this graph. The results related to the embedding problem are given in the paper [7]. There is the list of all isomorphism classes of finite commutative rings for which the associated ...

5

On two energy like invariants of line graphs and related graph operations

On two energy like invariants of line graphs and related graph operations

... The line graph L(G) of a graph G is the graph whose vertices are the edges of G, with two vertices in L(G) adjacent whenever the corresponding edges in G have exactly one vertex in ...regular ...

15

Adjacent Vertex Distinguishing Total Coloring of Line and Splitting Graph of Some Graphs

Adjacent Vertex Distinguishing Total Coloring of Line and Splitting Graph of Some Graphs

... We found the adjacent vertex distinguishing total chromatic number of line graph of Fan graph, double star, Friendship graph and splitting graph of path, cycle, star and sun let ...

11

A Study on the Inj Equitable Graph of a Graph

A Study on the Inj Equitable Graph of a Graph

... Definition 19 Let G = ( V E , ) be a graph . A subset D of V is called degree Inj-equitable set if the difference between the injective degree of any two vertices in D less then or equal one . The maximum ...

10

Topics in graph colouring and graph structures

Topics in graph colouring and graph structures

... of graph theory stemming from the eponymous theorem which, in its simplest form, states that any sufficiently large graph will contain a clique or anti-clique of a specified ...underlying graph which ...

292

Groups for which the noncommuting graph is a split graph

Groups for which the noncommuting graph is a split graph

... In this paper, we will consider only simple, undirected and finite graphs, i.e., undirected graphs on a finite number of vertices without multiple edges or loops. Let Γ = (V, E) be a graph with vertex set V and ...

7

Show all 9962 documents...

Related subjects