Results 31 to 40 of about 4,649,293 (309)
On the entire Zagreb indices of the line graph and line cut-vertex graph of the subdivision graph
Open Journal of Mathematical Sciences, 2020 Let \(G=(V,E)\) be a graph. Then the first and second entire Zagreb indices of \(G\) are defined, respectively, as \(M_{1}^{\varepsilon}(G)=\displaystyle \sum_{x \in V(G) \cup E(G)} (d_{G}(x))^{2}\) and \(M_{2}^{\varepsilon}(G)=\displaystyle \sum_{\{x,y\}
H. M. Nagesh +2 more
semanticscholar +1 more source
Line-Graph Lattices: Euclidean and Non-Euclidean Flat Bands, and Implementations in Circuit Quantum Electrodynamics [PDF]
Communications in Mathematical Physics, 2019 Materials science and the study of the electronic properties of solids are a major field of interest in both physics and engineering. The starting point for all such calculations is single-electron, or non-interacting, band structure calculations, and in
Alicia J. Koll'ar +3 more
semanticscholar +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
P. Deepa +2 more
doaj +1 more source
Complex, 2020 Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S.
Jia-bao Liu, A. Zafari
semanticscholar +1 more source
Discussiones Mathematicae Graph Theory, 2013 The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source
Resolving sets of vertices with the minimum size in graphs [PDF]
ریاضی و جامعه, 2023 Suppose that $G$ is a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A subset $S=\{s_1, s_2,\ldots , s_l \}$ of vertices of graph $G$ is called a doubly resolving set of $G$, if for any distinct vertices $u$ and $v$ in $G$ there are ...
Ali Zafari, Nader Habibi, Saeid Alikhani
doaj +1 more source
On the application of line graphs in quantitative structure-property studies [PDF]
Journal of the Serbian Chemical Society, 2000 Let G be a molecular graph possessing m0(G) edges. Let m1(G) be the number of edges of the line graph L(G) of G, known as the Bertz index. Let m2(G) be the number of edges of the line graph of L(G), etc.
Gutman Ivan, Tomović Željko
doaj +1 more source
Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning
Mathematics, 2023 Biomedical interaction prediction is essential for the exploration of relationships between biomedical entities. Predicted biomedical interactions can help researchers with drug discovery, disease treatment, and more.
Shilin Sun +3 more
doaj +1 more source
Some Properties of Regular Line Graphs
مجلة علوم ذي قار, 2019 In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources