Results 21 to 30 of about 5,977,266 (359)
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
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
A number theoretic problem on super line graphs
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
Outerplanarity of line graphs and iterated line graphs
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 +3 more sources
Fragile topology in line-graph lattices with two, three, or four gapped flat bands
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
On the Planarity of Generalized Line Graphs
One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah+2 more
doaj +1 more source
This study investigated the graphing skills and some affective states of middle school students about graphs by their gender, grade level, and the common graph types used in science courses.
Murat Bursal, Fuat Polat
semanticscholar +1 more source
Graphs whose line graphs are ring graphs
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 +1 more source
General Randić indices of a graph and its line graph
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
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