Results 31 to 40 of about 39,337 (267)
Sharp Bounds on (Generalized) Distance Energy of Graphs
Mathematics, 2020 Given a simple connected graph G, let D ( G ) be the distance matrix, D L ( G ) be the distance Laplacian matrix, D Q ( G ) be the distance signless Laplacian matrix, and T r ( G ) be the vertex transmission ...
Abdollah Alhevaz +3 more
doaj +1 more source
Automorphism groups of the constituent graphs of integral distance graphs
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph [Formula: see text] The automorphism groups of the integral ...
O. Habineza, E. Mwambene
doaj +1 more source
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2017 J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
Ural Mathematical JournalWe consider antipodal graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev +2 more
doaj +1 more source
Arithmetic completely regular codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen +3 more
doaj +1 more source
Locally Pseudo-Distance-Regular Graphs
Journal of Combinatorial Theory, Series B, 1996 The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph \(\Gamma\) when it is seen from a given vertex.
Fiol, M.A., Garriga, E., Yebra, J.L.A.
openaire +2 more sources
Molecular Oncology, EarlyView.The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola +12 more
wiley +1 more source
IEEE Access, 2018 The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +1 more source
ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
Ural Mathematical Journal, 2022 In the present paper, we classify abelian antipodal distance-regular graphs \(\Gamma\) of diameter 3 with the following property: \((*)\) \(\Gamma\) has a transitive group of automorphisms \(\widetilde{G}\) that induces a primitive almost simple ...
Ludmila Yu. Tsiovkina
doaj +1 more source
Distance-regular antipodai covering graphs
Journal of Combinatorial Theory, Series B, 1988 Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_
Aldred, R.E.L, Godsil, C.D
openaire +2 more sources