Relevant bibliographies by topics / Prism of graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Prism of graphs'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Prism of graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Prism of graphs"

1

Zeen El Deen, Mohamed R. "Enumeration of spanning trees in prisms of some graphs." Proyecciones (Antofagasta) 42, no. 2 (2023): 339–91. http://dx.doi.org/10.22199/issn.0717-6279-4664.

Full text
Abstract:
In graph theory, a prism over a graph G is the cartesian product of the graph G with P₂. The purpose of this work is to investigate the complexity of the prisms of some path and cycle-related graphs. In particular, we obtain simpler and more explicit formulas for the complexity of a special class of prisms of path-related graphs: fan graph, ladder graph, the composition Pn[P₂] graph, and book graph. Moreover, we obtain straightforward formulas for the complexity of a special class of prisms of cycle-related graphs: wheel graph, gear graph, prism graph, n−crossed prism graph, mirror graph M(Cn)
APA, Harvard, Vancouver, ISO, and other styles
2

Raksha, M. R., P. Hithavarshini, Charles Dominic, and N. K. Sudev. "Injective coloring of complementary prism and generalized complementary prism graphs." Discrete Mathematics, Algorithms and Applications 12, no. 02 (2020): 2050026. http://dx.doi.org/10.1142/s1793830920500263.

Full text
Abstract:
The complementary prism [Formula: see text] of a graph [Formula: see text] is the graph obtained by drawing edges between the corresponding vertices of a graph [Formula: see text] and its complement [Formula: see text]. In this paper, we generalize the concept of complementary prisms of graphs and determine the injective chromatic number of generalized complementary prisms of graphs. We prove that for any simple graph [Formula: see text] of order [Formula: see text], [Formula: see text] and if [Formula: see text] is a graph with a universal vertex, then [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
3

Gayathri, M. "On Vertex-Based Dimension of Some Graphs Joining Certain Prism Graphs." Graduate Journal of Interdisciplinary Research, Reports and Reviews 2, no. 01 (2024): 46–53. https://doi.org/10.34256/gjir3.v2i01.12.

Full text
Abstract:
Background: In graph theory, the prism graph is a type of graph that is characterised by having the structure of a prism as its underlying framework. The notion of a resolving set and that of metric dimension for a graph of a prism is important in uniquely identifying the vertices within a prism graph. For a non-trivial connected graph $\Gamma_{r}=\Gamma_{r}(V, E)$, an ordered subset $U$ of vertices $resolves$ any pair of different vertices $y_{1}, y_{2} \in V$, if $d(v, y_{1})\neq d(v, y_{2})$ for some $v\in U$. Such a set $U$ is said to be a resolving set for $\Gamma_{r}$ and the smallest ca
APA, Harvard, Vancouver, ISO, and other styles
4

Gomathi, P., and R. Murali. "LACEABILITY PROPERTIES IN PRISM GRAPHS." Advances and Applications in Discrete Mathematics 19, no. 4 (2018): 437–44. http://dx.doi.org/10.17654/dm019040437.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ortiz, Juan, Andrew Zemke, Hala King, Darren Narayan, and Mirko Horňák. "Minimalk-rankings for prism graphs." Involve, a Journal of Mathematics 3, no. 2 (2010): 183–90. http://dx.doi.org/10.2140/involve.2010.3.183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Aldred, R. E. L., and Michael D. Plummer. "Matching extension in prism graphs." Discrete Applied Mathematics 221 (April 2017): 25–32. http://dx.doi.org/10.1016/j.dam.2016.12.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Weigang Sun, Shuai Wang, and Jingyuan Zhang. "COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS." Journal of Applied Analysis & Computation 6, no. 1 (2016): 65–75. http://dx.doi.org/10.11948/2016006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Martinez, Paul, Juan Ortiz, Maggy Tomova, and Cindy Wyels. "Radio numbers for generalized prism graphs." Discussiones Mathematicae Graph Theory 31, no. 1 (2011): 45. http://dx.doi.org/10.7151/dmgt.1529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jacoby, Liza, Ralph Morrison, and Ben Weber. "Prism graphs in tropical plane curves." Involve, a Journal of Mathematics 14, no. 3 (2021): 495–510. http://dx.doi.org/10.2140/involve.2021.14.495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

He, Xiaocong, Yongtao Li, and Lihua Feng. "Extremal graphs for the odd prism." Discrete Mathematics 348, no. 1 (2025): 114249. http://dx.doi.org/10.1016/j.disc.2024.114249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Prism of graphs"

1

Félix, Juliana Paula. "Códigos identificadores em algumas classes de grafos." Universidade Federal de Goiás, 2018. http://repositorio.bc.ufg.br/tede/handle/tede/8222.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-16T10:48:35Z No. of bitstreams: 2 Dissertação - Juliana Paula Félix - 2018.pdf: 1739140 bytes, checksum: 14e7528cefac5d3322e49131936f3c86 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-16T10:49:04Z (GMT) No. of bitstreams: 2 Dissertação - Juliana Paula Félix - 2018.pdf: 1739140 bytes, checksum: 14e7528cefac5d3322e49131936f3c86 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Made availab
APA, Harvard, Vancouver, ISO, and other styles
2

Lira, Eduardo Silva. "O número de Carathéodory na convexidade geodésica de grafos." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6673.

Full text
Abstract:
Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2017-01-02T14:12:29Z No. of bitstreams: 2 Dissertação - Eduardo Silva Lira - 2016.pdf: 6831540 bytes, checksum: 4fe7b9bd7a7a3584d1cb48239b390f70 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-01-03T09:39:46Z (GMT) No. of bitstreams: 2 Dissertação - Eduardo Silva Lira - 2016.pdf: 6831540 bytes, checksum: 4fe7b9bd7a7a3584d1cb48239b390f70 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Made availabl
APA, Harvard, Vancouver, ISO, and other styles
3

Russell, Haley D. "Italian Domination in Complementary Prisms." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etd/3429.

Full text
Abstract:
Let $G$ be any graph and let $\overline{G}$ be its complement. The complementary prism of $G$ is formed from the disjoint union of a graph $G$ and its complement $\overline{G}$ by adding the edges of a perfect matching between the corresponding vertices of $G$ and $\overline{G}$. An Italian dominating function on a graph $G$ is a function such that $f \, : \, V \to \{ 0,1,2 \}$ and for each vertex $v \in V$ for which $f(v)=0$, it holds that $\sum_{u \in N(v)} f(u) \geq 2$. The weight of an Italian dominating function is the value $f(V)=\sum_{u \in V(G)}f(u)$. The minimum weight of all such fun
APA, Harvard, Vancouver, ISO, and other styles
4

Vaughan, Lamont D. "Double Domination of Complementary Prisms." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1983.

Full text
Abstract:
The complementary prism of a graph G is obtained from a copy of G and its complement G̅ by adding a perfect matching between the corresponding vertices of G and G̅. For any graph G, a set D ⊆ V (G) is a double dominating set (DDS) if that set dominates every vertex of G twice. The double domination number, denoted γ×2(G), is the cardinality of a minimum double dominating set of G. We have proven results on graphs of small order, specific families and lower bounds on γ×2(GG̅).
APA, Harvard, Vancouver, ISO, and other styles
5

Souter, Malcolm Robert. "Ray tracing acceleration using a choice of arrays of rectangular prisms." Thesis, Robert Gordon University, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kitzmann, Morgan. "Le complément grand-parental. Arrangements quotidiens, solidarités familiales et inégalités sociales au prisme de la prise en charge des jeunes enfants par les grands-parents." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUL117.

Full text
Abstract:
En France, les politiques de conciliation travail-famille reposent principalement sur le développement de modes de garde institutionnels. Les grands-parents continuent pourtant d’occuper une place importante dans les arrangements quotidiens des familles. Comment expliquer leur implication dans la garde des jeunes enfants ? En alliant sociologies de la famille et de l’articulation des temps sociaux, et en croisant méthodes qualitatives et quantitatives, cette thèse s’intéresse aux bricolages des parents au quotidien pour articuler vies familiale et professionnelle, à travers l’étude du cas limi
APA, Harvard, Vancouver, ISO, and other styles
7

Jaffré, Marc-Olivier. "Connaissance et optimisation de la prise en charge des patients : la science des réseaux appliquée aux parcours de soins." Thesis, Compiègne, 2018. http://www.theses.fr/2018COMP2445/document.

Full text
Abstract:
En France, la nécessaire rationalisation des moyens alloués aux hôpitaux a abouti à une concentration des ressources et une augmentation de la complexité des plateaux techniques. Leur pilotage et leur répartition territoriale s’avèrent d’autant plus difficile, soulevant ainsi la problématique de l’optimisation des systèmes de soins. L’utilisation des données massives produites pas ces systèmes pourrait constituer une nouvelle approche en matière d’analyse et d’aide à la décision. Méthode : A partir d’une réflexion sur la notion de performance, différentes approches d’optimisation préexistantes
APA, Harvard, Vancouver, ISO, and other styles
8

Helali, Hassan. "Méthodologie de pré-dimensionnement de convertisseurs de puissance : utilisation des techniques d'optimisation multi-objectif et prise en compte de contraintes CEM." Lyon, INSA, 2005. http://theses.insa-lyon.fr/publication/2006ISAL0085/these.pdf.

Full text
Abstract:
Dans le cadre du pré-dimensionnement des convertisseurs de puissances, la précision n’est pas primordiale, par contre des modèles analytiques simples sont nécessaires. Dans ce travail, nous avons proposé une nouvelle méthode analytique de prédiction des perturbations électromagnétiques conduites générées par les convertisseurs de puissance. Cette méthode se base sur l’analyse de causalité des graphes de liens et permet d’aboutir de manière systématique à des modèles analytiques suffisamment précis. La méthode a été validée expérimentalement. Nous avons aussi traité l’optimisation d’un hacheur
APA, Harvard, Vancouver, ISO, and other styles
9

Helali, Hassan Morel Hervé Slama-Belkhodja Ilhem. "Méthodologie de pré-dimensionnement de convertisseurs de puissance utilisation des techniques d'optimisation multi-objectif et prise en compte de contraintes CEM /." Villeurbanne : Doc'INSA, 2007. http://docinsa.insa-lyon.fr/these/pont.php?id=helali.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nachef, Armand. "Problème du voyageur de commerce relaxé : études algorithmiques et polyédrales." Grenoble 1, 1988. http://tel.archives-ouvertes.fr/tel-00329566.

Full text
Abstract:
Étant donnes un graphe g=(v,e) et une fonction cout définie sur les arêtes de ce graphe, cette thèse étudie le problème du voyageur de commerce relaxe qui consiste a trouver une tournée sur G, de longueur minimum, telle que chaque sommet soit visite au moins au fois
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Prism of graphs"

1

Aigner, Martin. Combinatorial search. B.G. Teubner, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Books, Stepney. Small Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Books, Stepney. Medium Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Books, Stepney. Small Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Books, Stepney. Medium Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Books, Stepney. Small Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Books, Stepney. Medium Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Books, Stepney. Medium Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Books, Stepney. Small Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Books, Stepney. Small Graph Composition Book: Geometric Prism. Independently Published, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Prism of graphs"

1

De Campos Mesquita, Felipe, Letícia Rodrigues Bueno, and Rodrigo De Alencar Hausen. "Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle." In LATIN 2014: Theoretical Informatics. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54423-1_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Thanigajalam, M., V. Shendra Shainy, G. Uma Maheswari, T. Sathinathan Thomas, and V. Balaji. "On Generalized Prism Graphs GP(m, 1) and SMT Labeling." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1449-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mary Jeya Jothi, R. "Acyclic structure of crossed prism and bi-star graphs of networks." In Challenges in Information, Communication and Computing Technology. CRC Press, 2024. http://dx.doi.org/10.1201/9781003559092-33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Spirakis, Paul G., Sotiris Nikoletseas, and Christoforos Raptopoulos. "Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models." In Lecture Notes in Computer Science. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-30448-4_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mohan, Anshuman, Wei Xiang Leow, and Aquinas Hobor. "Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.

Full text
Abstract:
AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices and edge lists. We certify binary heaps, including Floyd’s bottom-up heap construction, heapsort, and increase/decrease priority.Our verifications uncover subtle overflows implicit in standard textbook code, including a nontrivial bound on edge wei
APA, Harvard, Vancouver, ISO, and other styles
6

Biswas, Nabendu. "Creating an App with Prisma." In Practical GraphQL. Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-9621-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Miyauchi, Miki. "Topological Graph Layouts into a Triangular Prism." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48532-4_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gómez, Renzo, Flávio K. Miyazawa, and Yoshiko Wakabayashi. "Tree 3-Spanners on Generalized Prisms of Graphs." In LATIN 2022: Theoretical Informatics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-20624-5_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jahoda, Pavel, Yousef Yeganeh, Ehsan Adeli, Nassir Navab, and Azade Farshad. "PRISM: Progressive Restoration for Scene Graph-Based Image Manipulation." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91838-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yankovskaya, Anna. "2-Simplex Prism as a Cognitive Graphics Tool for Decision-Making." In Encyclopedia of Computer Graphics and Games. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-08234-9_285-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Prism of graphs"

1

Maragathavalli, K., and R. Mary Jeya Jothi. "Advanced Cryptographic Schemes Using Prism Graphs for Secure Data Transmission." In 2025 4th International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE). IEEE, 2025. https://doi.org/10.1109/icdcece65353.2025.11035375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kalarani, P., R. Revathi, R. Vijaykrishnaraj, A. Suganya, and K. Vijayalakshmi. "Optimized Modular Multiplicative Divisor Labeling for Efficient Minimum Spanning Tree Computation in Jellyfish Graphs Using Prims Algorithm." In 2025 8th International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2025. https://doi.org/10.1109/icoei65986.2025.11013719.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Camargo, Priscila, Alan D. A. Carneiro, and Uéverton S. Santos. "Complexidade Parametrizada de Cliques e Conjuntos Independentes em Grafos Prismas Complementares." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3166.

Full text
Abstract:
The complementary prism GG¯ arises from the disjoint union of the graph G and its complement G¯ by adding the edges of a perfect matching joining pairs of corresponding vertices of G and G¯. The classical problems of graph theory, clique and independent set were proved NP-complete when the input graph is a complemantary prism. In this work, we study the complexity of both problems in complementary prisms graphs from the parameterized complexity point of view. First, we prove that these problems have a kernel and therefore are Fixed-Parameter Tractable (FPT). Then, we show that both problems do
APA, Harvard, Vancouver, ISO, and other styles
4

Faria, Luerbio, Mauro Nigro, and Diana Sasaki. "On the conformable colorings of k-regular graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.230063.

Full text
Abstract:
In 1988, Chetwynd and Hilton defined conformable vertex colorings when trying to characterize the vertex colorings induced by a (∆ + 1)-total coloring. Anticonformable colorings were used to characterize the subcubic conformable graphs. A graph G is anticonformable if it has a (∆ + 1)-vertex coloring such that the number of color classes (including empty color classes) with the same parity as |V| is at most def(G) = ∑v∈V (∆− dG(v)). The only connected subcubic not anticonformable graph is the triangular prism graph L3. In this paper, we prove that if k is even, then every k-regular graph is no
APA, Harvard, Vancouver, ISO, and other styles
5

Momeni, Amir Farid, Robert J. Peterman, B. Terry Beck, Chih-Hang John Wu, and Naga Narendra B. Bodapati. "Effect of Prestressing Wire Indentation Type on the Bond Performance and Flexural Capacity of Pretensioned Concrete Crossties Subjected to Cyclic Loading." In 2016 Joint Rail Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/jrc2016-5761.

Full text
Abstract:
Load tests were conducted on pretensioned concrete prisms cast with 13 different 5.32-mm-diameter prestressing wire types that are used in the manufacture of pretensioned concrete railroad ties worldwide. The tests were specifically designed to evaluate the bond performance of wires with different indentation type under the cyclic loading. The prestressing wires were denoted “WA” through “WM” and indentation types included smooth, spiral, chevron, diamond, 2-dot and 4-dot. Four wires were embedded into each concrete prism, which had a 3.5″ (88.9 mm) × 3.5″ (88.9 mm) square cross section. The w
APA, Harvard, Vancouver, ISO, and other styles
6

Zatesko, Leandro M., Renato Carmo, and André L. P. Guedes. "Novel Procedures for Graph Edge-colouring." In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6331.

Full text
Abstract:
We present a novel recolouring procedure for graph edge-colouring. We show that all graphs whose vertices have local degree sum not too large can be optimally edge-coloured in polynomial time. We also show that the set ofthe graphs satisfying this condition includes almost every graph (under the uniform distribution). We present further results on edge-colouring join graphs, chordal graphs, circular-arc graphs, and complementary prisms, whose proofs yield polynomial-time algorithms. Our results contribute towards settling the Over- full Conjecture, the main open conjecture on edge-colouring si
APA, Harvard, Vancouver, ISO, and other styles
7

Eremchenko, Eugene Nikolaevich. "Digital Earth: Prism of 2021." In 32nd International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/graphicon-2022-756-761.

Full text
Abstract:
The study examines the development of the scientific concept of the Digital Earth in 2021, related technologies, as well as social practices of its use and implementation. The work is of an overview and interdisciplinary nature. Special attention is paid to the possibilities of applying Digital Earth to the analysis of global highly dynamic processes of a socio-technogenic nature, such as the COVID-19 pandemic. Digital Earth is considered in the context of the UN Sustainable Development Program, as well as digital economy and smart city initiatives. The problem of the Vision of the Digital Ear
APA, Harvard, Vancouver, ISO, and other styles
8

Eremchenko, Eugene. "Digital Earth: Prism of 2020." In 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-555-563.

Full text
Abstract:
Through the prism of the 8th Digital Earth Summit and within the context of the disastrous 2020, this article addresses some of the issues and challenges that need to be addressed in Digital Earth Vision 2030. Some significant scientific aspects of the Digital Earth development are described and briefly discussed: the problem of providing a satisfactory definition of the Digital Earth and typology of different geospatial visualizations, the ambiguity between the concepts of Digital Earth and Digital Twins, the problems arising from the use of Digital Earth in sustainable development as well as
APA, Harvard, Vancouver, ISO, and other styles
9

Banjanin, Bojan, Jelena Kerac, Savka Adamović, and Rastko Milošević. "GAME DESIGN STUDIES: THROUGH THE EDUCATIONAL PRISM." In INTERNATIONAL SYMPOSIUM ON GRAPHIC ENGINEERING AND DESIGN. UNIVERSITY OF NOVI SAD FACULTY OF TECHNICAL SCIENCES DEPARTMENT OF GRAPHIC ENGINEERING AND DESIGN 21000 Novi Sad, Trg Dositeja Obradovića 6, 2024. http://dx.doi.org/10.24867/grid-2024-p84.

Full text
Abstract:
One of the most challenging and maybe most important tasks of working as a professor and instructor is creating a purposeful and engaging curriculum program. To convey the right theoretical information and practical knowledge, professors go through an iterative process of learning through self- education, teaching, correcting, and adjusting their teaching approach. One must embark on the journey of self-discovery, proper communication, and willingness to change and adapt the curriculum to meet the requirements of industry standards, students, and technology. This paper aims to give insight int
APA, Harvard, Vancouver, ISO, and other styles
10

Vinod-Buchinger, Aditya, and Sam Griffiths. "Spatial cultures of Soho, London. Exploring the evolution of space, culture and society of London's infamous cultural quarter." In Post-Oil City Planning for Urban Green Deals Virtual Congress. ISOCARP, 2020. http://dx.doi.org/10.47472/sxol5829.

Full text
Abstract:
Space as affording social interaction is highly debated subject among various epistemic disciplines. This research contributes to the discussion by shedding light on urban culture and community organisation in spatialised ways. Providing a case of London’s famous cultural quarter, Soho, the research investigates the physical and cultural representation of the neighbourhood and relates it to the evolving socio-spatial logic of the area. Utilising analytical methods of space syntax and its network graph theories that are based on the human perception of space, the research narrates the evolution
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Prism of graphs"

1

Deryagina, Madina, and Ilia Mednykh Mednykh. On the Jacobian Group for Möbius Ladder and Prism Graphs. GIQ, 2014. http://dx.doi.org/10.7546/giq-15-2014-117-126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Prism of graphs' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography