Results 31 to 40 of about 114,426,441 (303)
Distance equienergetic graphs of diameter 4
Examples and CounterexamplesLet Γ1, Γ2 and Γ3 be graphs with pairwise disjoint vertex sets. The graph Θ(Γ1,Γ2,Γ3) is obtained from the graphs Γ1∘Γ3 (the corona product) and Γ2 by joining each vertices of Γ1 in Γ1∘Γ3 with every vertices in Γ2.
B.J. Manjunatha +2 more
doaj +1 more source
Distances in orientations of graphs
Journal of Combinatorial Theory, Series B, 1978 We prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G, then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, we show that every undirected bridgeless graph of radius r admits an orientation of radius at most $
Vasek Chvátal, Carsten Thomassen
openaire +2 more sources
On the graph of large distances [PDF]
Discrete & Computational Geometry, 1989 Let \(S\) be a set of \(n\) points in the plane and let \(d_1>d_2>..\). be the different distances determined by the set \(S\). The graph \(G(S,k)\) is considered whose vertex set is S and in which two vertices are adjacent if and only if their distance is at least \(k\). The chromatic number \(\chi(G(S,k))\) of \(G(S,k)\) is studied. It is proved that
Erdös, P. +2 more
openaire +1 more source
ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
Kyushu Journal of Mathematics, 1994 Let \(G\) be a graph. The distance \(i\)-graph of \(G\) is the graph \(G_ i\) defined on the vertex set of \(G\), and \(u\) and \(v\) are adjacent if and only if the distance between \(u\) and \(v\) is \(i\). This paper studies the distance \(i\)-graph of a distance regular graph and its connected component, and obtains a lot of special features of the
openaire +2 more sources
On the degree distance of a graph
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Dankelmann +3 more
openaire +2 more sources
FEBS Letters, EarlyView.Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai +4 more
wiley +1 more source
The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
, 2023 Graf nazýváme distančně dědičný když v libovolném souvislém indukovaném podgrafe je vzdálenost dvou vrcholů rovnaká jako v původním grafu. V článku dokážeme, že WL-dimenze distnčně dědičných grafů je dva.A graph is said to be distance-hereditary if the ...
Roman Nedela +6 more
core +1 more source
Some new results on the reciprocal complementary Wiener number of graphs [PDF]
Contributions to Mathematics, 2022 Ramin Nasiri, Ali Reza Shojaeifard
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