Results 21 to 30 of about 5,992,367 (377)
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
Preservation of the Classical Meanness Property of Some Graphs Based on Line Graph Operation
Journal of mathematics, 2021 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
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
A result on Hamiltonian line graphs involving restrictions on induced subgraphs [PDF]
, 1988 It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G.
Benhocine +11 more
core +8 more sources
A number theoretic problem on super line graphs
AKCE International Journal of Graphs and Combinatorics, 2016 In Bagga et al. (1995) a generalization of the line graph concept was introduced. Given a graph G with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r edges of G, with two adjacent if there is an edge in one ...
Jay Bagga, Lowell Beineke, Badri Varma
doaj +1 more source
Axioms, 2022 The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) for all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this note, we show that R(L(T))>n4 for any tree T of order n≥3.
Jiangfu Zhang, Baoyindureng Wu
doaj +1 more source
Outerplanarity of line graphs and iterated line graphs
Applied Mathematics Letters, 2011 AbstractThe outerplanar index of a graph G is the smallest integer k such that the kth iterated line graph of G is non-outerplanar. In this note, we show: (i) the characterization of the forbidden subgraphs for graphs with outerplanar line graphs; (ii) that the outerplanar index of a graph is either infinite or at most 3.
Huiqiu Lin +4 more
openaire +2 more sources
Fragile topology in line-graph lattices with two, three, or four gapped flat bands
Physical Review Research, 2020 The authors present a theoretical formalism to determine the band topology of flat bands in line-graph lattices, identifying families of lattices with fragile-topological flat bands.
Christie S. Chiu +4 more
semanticscholar +1 more source
General Randić indices of a graph and its line graph
Open Mathematics, 2023 For a real number α\alpha , the general Randić index of a graph GG, denoted by Rα(G){R}_{\alpha }\left(G), is defined as the sum of (d(u)d(v))α{\left(d\left(u)d\left(v))}^{\alpha } for all edges uvuv of GG, where d(u)d\left(u) denotes the degree of a ...
Liang Yan, Wu Baoyindureng
doaj +1 more source