Symbolic calculus in calculating of characteristic and acyclic polynomial of graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F01%3A6844" target="_blank" >RIV/62690094:18450/01:6844 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Symbolic calculus in calculating of characteristic and acyclic polynomial of graphs
Original language description
There are many polynomials closely connected with graphs and the theory of graphs. These polynomials are useful both in theory and its application as they enable to determine the properties of graphs and relations among graphs by the methods of algebraInour contribution we will illustrate the use of symbolic calculus of Matlab software package as an efficient assistant in calculating characteristic and acyclic polynomials of various types of graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
AM - Pedagogy and education
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Symbolic calculus in calculating of characteristic
ISBN
80-7042-180-0
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
"C9"-"C9"
Publisher name
Editor Graham M Chapman
Place of publication
University of Twente
Event location
Brno
Event date
Jan 1, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—