Filters
Solving circuits by multiple transformation graphs
This paper deals with solving electronics circuits by method of the transformation graphs. As described, the Masońs formula for calculation of the result can be left out in selected cases, and the theory of the transformation
Electrical and electronic engineering
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Solving circuits by multiple transformation graphs
This paper deals with solving electronics circuits by method of the transformation graphs only. As described, the Mason's formula for calculation of the result can be left out in selected cases, and the theory of the transformat...
Electrical and electronic engineering
- 2011 •
- JSC
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Transformers as Graph-to-Graph Models
"We argue that Transformers are essentially graph-to-graph models to graph edges. Our Graph-to-Graph Transformer architecture makes this ability explicit, by inputting graph edge...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Complexity of Compatible Decomposition of Eulerian Graphs and Their Transformations
Some earlier defined local transformations between eulerian trails are generalized into transformations between decompositions of graphs into (possibly more) closed subtrails....
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Modified summary graph method solving of the SC circuits
switched circuit in two-phase switching exclusively by the graph method as well. For this purposeit is possible to plot a Mason graph of a circuit, use transformation graphs Mason-Coates graph from the
JA - Elektronika a optoelektronika, elektrotechnika
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
Signal Flow Graph of the Transformer Model
graph ofthe transformer, therefore. analysis. One possible method is the analysis by means of signal flow graphs. Analysis of electronic circuits using the MB graph is in detail described in [2, 3]. There are deri...
JA - Elektronika a optoelektronika, elektrotechnika
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
Reachability in graph transformation systems and slice languages
In this work we show that the reachability problem for graph transformation R of graph transformation rules, one can determine in time f(c,d)G H g(c,d) whether a graph G of cutwidth c can be transfo...
BA - Obecná matematika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Solving switched capacitors circuits by full graph methods
. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphsto graph from the transformed graphs obtained this way. First we draw nodes and possible branches, obtained by...
Electrical and electronic engineering
- 2011 •
- JSC
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Graph Methods of Assembling of the Matrix of the SI Circuits
The paper deals with the possibility to graphs to compile a conductivity matrix describing a circuit with switched currents in two-phase switching. It demonstrates the compilation of a matrix by using a transformation graph...
JA - Elektronika a optoelektronika, elektrotechnika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
At least half of the leapfrog fullerene graphs have exponentially many Hamilton cycles
A fullerene graph is a 3-connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the trucation of the dual of the given graph. A fullerene <...
Pure mathematics
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 out of 42 974