-
Product graphs : structure and recognitionImrich, Wilfried ; Klavžar, SandiAdressing the growing usefulness of current methods for recognizing product graphs, this new work presents a much-needed, systematic treatment of the Cartesian, strong, direct and lexicographic ... product of graphs as well as graphs isometrically embedded into them. Written by two leading experts in this rapidly envolving area of combinatorics, this book compiles and consolidates a wealth of information previously scattered throughout the literature, providing researches in the field with ready acces to numerous recent results as well as several new recognition algorithms and proofs. The autors explain all topics from the ground up and make the requisite theory and data structures easily accessible for mathematicians and computer scientists alike. Coverage includes: - The basic algebraic and combinatorial properties of product graphs. - Hypercubes, median graphs, Hamming graphs, triangle-free graphs, and vertex-transitive graphs. - Colorings, automorphisms, homomorphisms, domination, and the capacity of products of graphs. - Sample applications, including novel applications to chemical graph theory. - Proofs and algorithms presented at varying levels of difficulty. - Clear connections to other areas of graph theory. - Fugures, exercises, and hundreds of references.Vrsta gradiva - znanstvena monografijaZaložništvo in izdelava - New York [etc.] : J. Wiley & Sons, cop. 2000Jezik - angleškiISBN - 0-471-37039-8COBISS.SI-ID - 9554009
Avtor
Imrich, Wilfried |
Klavžar, Sandi
Drugi avtorji
Gorenec, Bojan
Teme
matematika |
teorija grafov |
produkti grafov |
kartezični produkti |
krepki produkti |
direktni produkti |
leksikografski produkti |
hiperkocke |
medianski grafi |
Hammingovi grafi |
grafi brez trikotnikov |
po točkah tranzitivni grafi |
algoritmi |
aplikacije |
kemijska teorija grafov |
mathematics |
graph theory |
product graphs |
Cartesian products |
strong products |
direct products |
lexicographic products |
hypercubes |
median graphs |
Hamming graphs |
triangle-free graphs |
vertex-trabsitive graphs |
graph algorithms |
applications |
chemical graph theory
Knjižnica | Signatura – lokacija, inventarna št. ... | Status izvoda |
---|---|---|
Narodna in univerzitetna knjižnica, Ljubljana | GS 532415 glavno skladišče | prosto - na dom, čas izposoje: 30 dni |
Centralna tehniška knjižnica Univerze v Ljubljani | 217243 Skladišče IN: 120012598 |
prosto - na dom, čas izposoje: 14 dni |
FMF in IMFM, Matematična knjižnica, Ljubljana | Knjižnica-MAT Diskretna matematika 3506/24 2 |
prosto - na dom, čas izposoje: 1 mes. |
FMF in IMFM, Matematična knjižnica, Ljubljana | Knjižnica-MAT Diskretna matematika 3506/24 1 |
prosto - na dom, čas izposoje: 1 mes. |
FMF in IMFM, Matematična knjižnica, Ljubljana | Knjižnica-MAT Diskretna matematika 3506/24 |
izposojeno - na dom, rok vrnitve: 31.12.2024
Predvidoma na voljo po: 03.01.2025 (1. v čakalni vrsti) |
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|---|
Imrich, Wilfried | 11754 |
Klavžar, Sandi | 05949 |
Gorenec, Bojan | 90624 |
Izberite prevzemno mesto:
Prevzem gradiva po pošti
Obvestilo
Gesla v Splošnem geslovniku COBISS
Izbira mesta prevzema
Mesto prevzema | Status gradiva | Rezervacija |
---|
Prosimo, počakajte trenutek.