Results 11 to 20 of about 4,649,293 (309)
Line-graph-lattice crystal structures of stoichiometric materials [PDF]
The origin of many quantum-material phenomena is intimately related to the presence of flat electronic bands. In quantum simulation, such bands have been realized through line-graph lattices, a class of lattices known to exhibit flat bands. Based on that
C. Chiu +3 more
semanticscholar +1 more source
New results and open problems in line graphs
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
Line graph characterization of power graphs of finite nilpotent groups [PDF]
This paper deals with the classification of groups G such that power graphs and proper power graphs of G are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all finite nilpotent groups
S. Bera
semanticscholar +1 more source
Line Graph Neural Networks for Link Prediction [PDF]
We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. With the advances of deep learning, current link prediction methods commonly compute features from subgraphs centered at two ...
Lei Cai +3 more
semanticscholar +1 more source
Graph schema and best graph type to compare discrete groups: Bar, line, and pie
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
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
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
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
Preservation of the Classical Meanness Property of Some Graphs Based on Line Graph Operation
In the present paper, we introduce the classical mean labeling of graphs and investigate their related properties. Moreover, it is obtained that the line graph operation preserves the classical meanness property for some standard graphs.
G. Muhiuddin +3 more
semanticscholar +1 more source
Every $3$-connected, essentially $11$-connected line graph is hamiltonian [PDF]
Thomassen conjectured that every $4$-connected line graph is hamiltonian. A vertex cut $X$ of $G$ is essential if $G-X$ has at least two nontrivial components. We prove that every $3$-connected, essentially $11$-connected line graph is hamiltonian. Using
Hong-Jian Lai +3 more
doaj +1 more source

