Filters
Endomorphism monoids of chained graphs
A chain of subgraphs (or quotient graphs) preserving suprema and infima of the chain with prescribed endomorphism monoids is constructed. An application in universal algebra is presented....
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Characterization of essential graphs by means of the operation of legal merging of components
is presented. The main observation is that every essential graph is the largest chain graph withina special class of chain graphs without flags. A special operation of legal merging of components for thes...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Chain graph models and their causal interpretations - discussion on the paper by Lauritzen and Richardson.
The comment offers the interpretation of chain graph models in terms of factorization instead of vague concept of data generating process....
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Characterization of essential graphs by means of an operation of legal component merging.
graphs is presented. The characterization is based on a special operation with chain graphs without flags which is called the legal component merging. The operation leads of chain graphs without flags, in...
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
The chain relation in sofic subshifts
The paper gives a characterisation of the chain relation of a sofic subshift S. Factorising the graph of the sofic subshift in a suitable way we obtain a graph that offers insight into some properties of the original subshi...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A graphical representation of equivalence classes of AMP chain graphs
A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is proposed. The representative is based on revealed internal structure of the AMP Markov equivalence class. A composed graphical procedure to gest ...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Two operations of merging and splitting components in a chain graph
Two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense, are studied. They allow one to prove easily some technical results on fac...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Identification of Attack Paths Using Kill Chain and Attack Graphs
of multi-step cyber threat scenarios using kill chain and attack graphs. Kill chain defense points. We propose a novel kill chain attack graph that merges kill chain and attack graphs to...
Computer and information sciences
- 2022 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Cantor spectra of magnetic chain graphs
We demonstrate a one-dimensional magnetic system can exhibit a Cantortype spectrum using an example of a chain graph with d coupling at the vertices exposed to a magnetic field perpendicular to the graph plane and varying a...
Atomic, molecular and chemical physics (physics of atoms and molecules including collision, interaction with radiation, magnetic resonances, Mössbauer effect)
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
FIBONACCI NUMBERS OF GRAPHS CORRESPONDING TO A TYPE OF HEXAGONAL CHAINS
of graphs corresponding to one type of hexagonal chains are calculated by using the decomposition formula. Searching of the Fibonacci numbers of certain classes of graphs leads to difference equations or their systems. The...
BA - Obecná matematika
- 2014 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 21 982