Results 21 to 30 of about 114,426,441 (303)
The distance spectrum of two new operations of graphs [PDF]
Transactions on Combinatorics, 2020 Let $G$ be a connected graph with vertex set $V(G)=\{v_1, v_2,\ldots,v_n\}$. The distance matrix $D=D(G)$ of $G$ is defined so that its $(i,j)$-entry is equal to the distance $d_G(v_i,v_j)$ between the vertices $v_i$ and $v_j$ of $G$. The eigenvalues
Zikai Tang +3 more
doaj +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
Distance-unbalancedness of graphs [PDF]
Applied Mathematics and Computation, 2021 14 pages, 3 ...
Miklavič, Štefko, Šparl, Primož
openaire +2 more sources
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
Mathematica Bohemica, 2018 Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Minjie Zhang, Shuchao Li
doaj +1 more source
Cospectral constructions for several graph matrices using cousin vertices
Special Matrices, 2021 Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
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
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj +3 more sources
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Distance independence in graphs
Discussiones Mathematicae Graph Theory, 2011 For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number (G) = {1}(G).
J. Louis Sewell, Peter J. Slater
openaire +1 more source
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