Results 31 to 40 of about 177,806 (308)
Spectral recognition of graphs [PDF]
Yugoslav Journal of Operations Research, 2012 At some time, in the childhood of spectral graph theory, it was conjectured that non-isomorphic graphs have different spectra, i.e. that graphs are characterized by their spectra.
Cvetković Dragoš
doaj +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Metric Locations in Pseudotrees: A Survey and New Results
MathematicsThis paper presents a comprehensive review of the literature on the original concept of metric location, along with its various adaptations and extensions that have been developed over time.
José Cáceres, Ignacio M. Pelayo
doaj +1 more source
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
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 +1 more source
The distance coloring of graphs [PDF]
Acta Mathematica Sinica, English Series, 2014 Let $G$ be a connected graph with maximum degree $Δ\ge 3$. We investigate the upper bound for the chromatic number $χ_γ(G)$ of the power graph $G^γ$. It was proved that $χ_γ(G) \leΔ\frac{(Δ-1)^γ-1}{Δ-2}+1=:M+1$ with equality if and only $G$ is a Moore graph.
Miao, Lian Ying, Fan, Yi Zheng
openaire +2 more sources
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
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +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