Results 1 to 10 of about 1,361,736 (138)

Line Graphs of Monogenic Semigroup Graphs

Journal of Mathematics, 2021
The concept of monogenic semigroup graphs Γ S M
Nihat Akgunes, Yasar Nacaroglu, Sedat Pak   +2 more
openaire   +2 more sources

Graph Equations for Line Graphs, Jump Graphs, Middle Graphs, Splitting Graphs And Line Splitting Graphs

Mapana - Journal of Sciences, 2010
For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire   +2 more sources

Characterizing ‐perfect line graphs [PDF]

International Transactions in Operational Research, 2016
AbstractThe aim of this paper is to study the Lovász‐Schrijver PSD operator applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which generates the stable set polytope in one step, called ‐perfect graphs.
Escalante, Mariana Silvina, Nasini, Graciela Leonor, Wagler, Annegret Katrin   +2 more
openaire   +5 more sources

Tight Frame Graphs Arising as Line Graphs

The PUMP Journal of Undergraduate Research, 2021
Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues.  From the point of view of frame theory, their characterization can be restated as which graphs have a representation by a tight frame.
Furst, Veronika, Grotts, Howard
openaire   +3 more sources

BOREL LINE GRAPHS

The Journal of Symbolic Logic
Abstract We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space.
JAMES ANDERSON, ANTON BERNSHTEYN
openaire   +2 more sources

Outerplanarity of line graphs and iterated line graphs

Applied Mathematics Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Yang, Weihua, Zhang, Hailiang, Shu, Jinlong   +3 more
openaire   +2 more sources

Boxicity of line graphs

Discrete Mathematics, 2011
Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2 (\lceil log_2(log_2( )) \rceil + 3) + 1, where denotes the maximum degree of G. Since <= 2( - 1), for any line graph
Chandran, Sunil L, Mathew, Rogers, Sivadasan, Naveen   +2 more
openaire   +4 more sources

On chordal graph and line graph squares [PDF]

Discrete Applied Mathematics, 2018
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, Sebastian Wiederrecht   +1 more
openaire   +2 more sources

Line graphs of directed graphs. I.

Transactions on Combinatorics
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   +4 more sources

Graph Equation for Line Graphs and m-Step Graphs [PDF]

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Seog-Jin, Kim, Suh-Ryung, Lee, Jung Yeun, Park, Won Jin, Sano, Yoshio   +4 more
openaire   +1 more source