Results 1 to 10 of about 5,414,210 (302)
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 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 ...
Mahdi Reza Khorsandi
doaj +3 more sources
, 2011 In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems.
Reddy, P. Siva Kota +2 more
openaire +4 more sources
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe 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 ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +5 more sources
Modeling functional connectivity changes during an auditory language task using line graph neural networks [PDF]
Frontiers in Computational NeuroscienceFunctional connectivity (FC) refers to the activation correlation between different brain regions. FC networks as typically represented as graphs with brain regions of interest (ROIs) as nodes and functional correlation as edges.
Stein Acker +9 more
doaj +2 more sources
On the planarity of line Mycielskian graph of a graph [PDF]
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +2 more sources
New results and open problems in line graphs
AKCE International Journal of Graphs and Combinatorics, 2022 Given a graph G with at least one edge, the line graph L(G) is that graph whose vertices are the edges of G, with two of these vertices being adjacent if the corresponding edges are adjacent in G.
Jay Bagga, Lowell Beineke
doaj +1 more source
Graph schema and best graph type to compare discrete groups: Bar, line, and pie
Frontiers in Psychology, 2022 Different graph types may differ in their suitability to support group comparisons, due to the underlying graph schemas. This study examined whether graph schemas are based on perceptual features (i.e., each graph type, e.g., bar or line graph, has its ...
Fang Zhao, Robert Gaschler
doaj +1 more source
Independent point-set domination in line graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source
An Even 2-Factor in the Line Graph of a Cubic Graph
Theory and Applications of Graphs, 2022 An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G.
SeungJae Eom, Kenta Ozeki
doaj +1 more source
Omega Index of Line and Total Graphs
Journal of Mathematics, 2021 A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph.
Musa Demirci +3 more
doaj +1 more source