Results 11 to 20 of about 836,691 (279)
Distance spectrum of Indu–Bala product of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj +3 more sources
A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2
Algorithms, 2021 Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalization of
Serafino Cicerone
doaj +1 more source
The Threshold Dimension and Irreducible Graphs
Discussiones Mathematicae Graph Theory, 2023 Let G be a graph, and let u, v, and w be vertices of G. If the distance between u and w does not equal the distance between v and w, then w is said to resolve u and v.
Mol Lucas +2 more
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 The status of a vertex , denoted by , is the sum of the distances between and all other vertices in a graph . The first and second status connectivity indices of a graph are defined as and respectively, where denotes the edge set of .
Harishchandra S. Ramane +2 more
doaj +1 more source
The Generalized Distance Spectrum of the Join of Graphs [PDF]
, 2020 Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +2 more sources
Weiner Polynomials to Generalize the Distance of Some Composite Graphs from Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 It is not easy to find the Wiener polynomials for generalized distance of compound graphs constructed in the form and for any two disjoint connected graphs and .Therefore, in this paper, we obtain Wiener polynomials for generalized distance of and ...
Ali Ali, Ahmed Ali
doaj +1 more source
Dualizing Distance-Hereditary Graphs
Discussiones Mathematicae Graph Theory, 2021 Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source
Steiner Wiener index of block graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size of a connected subgraph of G containing all the vertices of S.
Matjaž Kovše +2 more
doaj +1 more source
Geometric aspects of 2-walk-regular graphs [PDF]
, 2013 A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular graphs and $t$
Cámara, Marc +3 more
core +1 more source
Distinct Distances in Graph Drawings [PDF]
The Electronic Journal of Combinatorics, 2008 The distance-number of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distance-number of trees, graphs with no $K^-_4$-minor, complete bipartite graphs, complete graphs, and cartesian products.
Carmi, Paz +3 more
openaire +3 more sources