Results 31 to 40 of about 832,958 (281)
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
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
Graphs with small diameter determined by their $D$-spectra [PDF]
Let $G$ be a connected graph with vertex set $V(G)=\{v_{1},v_{2},...,v_{n}\}$. The distance matrix $D(G)=(d_{ij})_{n\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$ and $v_{j ...
Liu, Ruifang, Xue, Jie
core +2 more sources
Distances in Domino Flip Graphs
15 pages, 9 ...
Parlier, Hugo, Zappa, Samuel
openaire +4 more sources
Cospectral constructions for several graph matrices using cousin vertices
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
In this paper, we consider a simple connected graph having no loops and multiple edges. The order and size of are denoted by and respectively in graphs is a wide branch of graph theory having many scientific and real-life applications. There are various types of distances studied in the literature.The distance is the length of the shortest path ...
null V. Thamarai Selvi +1 more
openaire +1 more source
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]
Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj +3 more sources
Metric Locations in Pseudotrees: A Survey and New Results
This 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
Spectral recognition of graphs [PDF]
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
Distance Domination in Vertex Partitioned Graphs
We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables ...
Frendrup, Allan +2 more
openaire +2 more sources
Distance equienergetic graphs of diameter 4
Let Γ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

