The alternating polynomials and their relation with the spectra and conditional diameters of graphs (Q1356468): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:03, 5 March 2024

scientific article
Language Label Description Also known as
English
The alternating polynomials and their relation with the spectra and conditional diameters of graphs
scientific article

    Statements

    The alternating polynomials and their relation with the spectra and conditional diameters of graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 December 1997
    0 references
    If \(G\) is a graph on \(n\) vertices, then the distance \(\partial(G_1,G_2)\) between two subgraphs \(G_1,G_2\subset G\) is the minimum among the distances between vertices of \(G_1\) and \(G_2\). In this paper some bounds of the conditional \((s,t)\)-diameter \((1\leq s,t\leq n)\) defined by \[ D_{(s,t)}= \max_{G_1,G_2\subset G}\{\partial(G_1,G_2):|V(G_1)|= 1\text{ and }|V(G_2)|=t\}, \] in terms of the eigenvalues of the graph, are obtained. By using the Laplacian spectrum, similar results for locally regular digraphs are also given.
    0 references
    diameter
    0 references
    distance
    0 references
    bounds
    0 references
    eigenvalues
    0 references
    Laplacian spectrum
    0 references
    digraphs
    0 references

    Identifiers