Results 31 to 40 of about 5,172,585 (353)
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
Electronic Notes in Discrete Mathematics, 2010 Abstract We observe that ω ( G ) + χ ( S ( G → ) ) = n = ω ( S ( G → ) ) + χ ( G ) for any graph G with n vertices, where G → is any acyclic orientation of G and where S ( G → ) is the (complement of the) auxiliary line graph introduced in [Cornaz, D., and Jost, V., A one-to-one ...
Cornaz, Denis, Meurdesoif, Philippe
openaire +2 more sources
International Journal of Education in Mathematics Science and Technology, 2020 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
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
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.
L. Sunil Chandran +2 more
openaire +4 more sources
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
On Automorphisms of Line-graphs
European Journal of Combinatorics, 1980 This paper generalizes some results on hypergraph reconstruction due to \textit{C. Berge} [C. R. Acad. Sci., Paris, Ser. A 274, 1783-1786 (1972; Zbl 0236.05129)] and \textit{J.C.Fournier} [Proc. 1rst Working Sem. Hypergraphs, Columbus 1972, Lecture Notes Math. 411, 95-98 (1974; Zbl 0302.05113)].
Péter L. Erdös, Zoltán Füredi
openaire +1 more source
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Solutions of Detour Distance Graph Equations
Sensors, 2022 Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha +7 more
doaj +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source