Results 11 to 20 of about 390,128 (262)
Graphs whose line graphs are ring graphs [PDF]
Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
Mahdi Reza Khorsandi
openaire +2 more sources
Interval-valued bipolar fuzzy line graphs. [PDF]
Objectives The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models.
Tola KA, Repalle VNSR, Ashebo MA.
europepmc +2 more sources
Line graphs of directed graphs. I. [PDF]
Summary: We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of directed graphs.
Sivaraman, Vaidy, Slilaty, Daniel
openaire +5 more sources
Interval Valued Intuitionistic Fuzzy Line Graphs. [PDF]
Objectives In the field of graph theory, an intuitionistic fuzzy set becomes a useful tool to handle problems related to uncertainty and impreciseness. We introduced the interval-valued intuitionistic fuzzy line graphs (IVIFLG) and explored the results ...
Repalle VNSR, Tola KA, Ashebo MA.
europepmc +2 more sources
Line Graphs of Monogenic Semigroup Graphs
The concept of monogenic semigroup graphs Γ S M
Nihat Akgunes +2 more
openaire +2 more sources
A preservice middle school mathematics teacher’s knowledge of student thinking about line graphs [PDF]
Interpreting statistical graphs and making inferences based on the graphs are a precursor for formal statistical inferences. To support student inferences, both teachers and future teachers should have adequate knowledge regarding students’ thinking on ...
Aytug Ozaltun Celik
doaj +1 more source
Neutrosophic Vague Line Graphs [PDF]
Neutrosophic graphs are employed as a mathematical key to hold an imprecise and unspecified data. Vague sets gives more intuitive graphical notation of vague information, that delicates crucially better analysis in data relationships, incompleteness and ...
S. Satham Hussain +2 more
doaj +1 more source
Sombor Index Under Some Graph Products [PDF]
Let G=(V, E) be a graph with vertex set V(G) and edge set E(G). The Sombor index of a graph G, SO(G), is defined as ∑uv∈ E(G) √(d2u+d2v), where du is the degree of vertex u in V(G). In the present paper, we determine the lower bound for the
Irandokht Rezaee Abdolhosseinzadeh +2 more
doaj +1 more source
On chordal graph and line graph squares [PDF]
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Robert Scheidweiler +1 more
openaire +2 more sources
Treewidth of the Line Graph of a Complete Graph [PDF]
AbstractIn recent articles by Grohe and Marx, the treewidth of the line graph of a complete graph is a critical example—in a certain sense, every graph with large treewidth “contains” . However, the treewidth of was not determined exactly. We determine the exact treewidth of the line graph of a complete graph.
Daniel J. Harvey, David R. Wood
openaire +2 more sources

