The estimation of the index of a graph

Result code in IS VaVaI

RIV/60162694:G43__/09:#0002997 - isvavai.cz

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

The estimation of the index of a graph

Original language description

Let G = (X,E) be an undirected graph without loops and multiple edges, the second power of G is the graph G^2 = (X,E') with the same vertex set X and in which mutually different vertices are adjacent if and only if there is at least one path of the length 1 or 2 in G between them. The characteristic polynomial of the adjacency matrix A of a graph G is called the characteristic polynomial of G and the eigenvalues and the spectrum of A are called the eigenvalues and the spectrum of G. The greatest eigenvalue of G is called the index of G. In this paper the estimation of the index of the second power of some classes of graphs is found.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

27th International Colloquium on the Management of Educational Process

ISBN

978-80-7231-650-2

ISSN

—

e-ISSN

—

Number of pages

4

Pages from-to

—

Publisher name

University of Defence

Place of publication

Brno

Event location

Brno

Event date

Jan 1, 2009

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

BLZ40