Log in

Relevant bibliographies by topics / Power graph

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Power graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 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 'Power graph.'

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 "Power graph"

1

Kaviya, S., G. Mahadevan, and C. Sivagnanam. "Generalizing TCCD-Number For Power Graph Of Some Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 115–23. http://dx.doi.org/10.17485/ijst/v17sp1.243.

Full text

Abstract:

Objective: Finding the triple connected certified domination number for the power graph of some peculiar graphs. Methods: A dominating set with the condition that every vertex in has either zero or at least two neighbors in and is triple connected is a called triple connected certified domination number of a graph. The minimum cardinality among all the triple connected certified dominating sets is called the triple connected certified domination number and is denoted by . The upper bound and lower bound of for the given graphs is found and then proved the upper bound and lower bound of were eq

APA, Harvard, Vancouver, ISO, and other styles

2

Paulin, S. Shiny, and T. Bharathi. "Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs." Indian Journal Of Science And Technology 17, no. 47 (2024): 5016–24. https://doi.org/10.17485/ijst/v17i47.3605.

Full text

Abstract:

Objectives: To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties. Methods: The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix. Findings: The condition for a power fuzzy graph, 𝐺𝑓 𝑘 to be vertex regular in terms of adjacency sequence has been verified. The energy sequence for the power fuzzy graph with increasing 𝑘 has been established. Novelty: The concept of minimizing the interval of the edge membership values

APA, Harvard, Vancouver, ISO, and other styles

3

S, Shiny Paulin, and Bharathi T. "Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs." Indian Journal of Science and Technology 17, no. 47 (2024): 5016–24. https://doi.org/10.17485/IJST/v17i47.3605.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties.<strong> Methods:</strong> The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix. <strong>Findings:</strong> The condition for a power fuzzy graph, 𝐺𝑓 𝑘 to be vertex regular in terms of adjacency sequence has been verified. The energy sequence for the power fuzzy graph with increasing 𝑘 has been estab

APA, Harvard, Vancouver, ISO, and other styles

4

Ral, Ranelyn I., and Ann Leslie V. Flores. "POWER GRAPH OF B-ALGEBRAS." Advances and Applications in Discrete Mathematics 42, no. 6 (2025): 515–30. https://doi.org/10.17654/0974165825035.

Full text

Abstract:

Power graphs have been extensively studied for their ability to represent algebraic structures through graph-theoretic concepts. This paper investigates the structural properties of power graphs associated with B-algebras, a class of algebras that exhibit certain group-like characteristics. Several graph-theoretic properties, including graph distance measures, are examined. In addition, conditions under which the power graph is complete, Eulerian, or Hamiltonian, as well as the behavior of power graphs under B-homomorphisms, are explored. Finally, the relationship between the center of a B-alg

APA, Harvard, Vancouver, ISO, and other styles

5

Putra, Lalu Riski Wirendra, Zata Yumni Awanis, Salwa Salwa, Qurratul Aini, and I. Gede Adhitya Wisnu Wardhana. "THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER." BAREKENG: Jurnal Ilmu Matematika dan Terapan 17, no. 3 (2023): 1393–400. http://dx.doi.org/10.30598/barekengvol17iss3pp1393-1400.

Full text

Abstract:

There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure.. Groups in Algebra can be represented as a graph. This is interesting because Groups are abstract objects in mathematics. The graph of a group shows the physical form of the group by looking at the relationship between its elements. So, we can know the distance of the elements. In 2013, Abawajy et al. conducted studies related to power graphs. Power gra

APA, Harvard, Vancouver, ISO, and other styles

6

Bharathi, T., S. Shiny Paulin, and M. Jeba Sherlin. "On regular power fuzzy graphs." Journal of Applied Mathematics, Statistics and Informatics 20, no. 2 (2024): 5–18. https://doi.org/10.2478/jamsi-2024-0011.

Full text

Abstract:

Abstract In this paper, we define the notion of regular power fuzzy graph (RPFG), as a combination of regular properties and power fuzzy graphs. We also define totally regular power fuzzy graph as a special case of RPFG. A comparative study between regular and totally regular power fuzzy graphs is investigated. It is also proved that any power fuzzy graph containing a pendant vertex can be neither regular nor totally regular. A necessary condition for a total power fuzzy graph to be perfectly regular is that the vertex and edge membership functions are constants.

APA, Harvard, Vancouver, ISO, and other styles

7

Pratama, Rendi Bahtiar, Fariz Maulana, Na'imah Hijriati, and I. Gede Adhitya Wisnu Wardhana. "SOMBOR INDEX AND ITS GENERALIZATION OF POWER GRAPH OF SOME GROUP WITH PRIME POWER ORDER." Journal of Fundamental Mathematics and Applications (JFMA) 7, no. 2 (2024): 163–73. https://doi.org/10.14710/jfma.v7i2.22552.

Full text

Abstract:

Graphs are an intriguing topic of discussion due to their numerous applications, particularly in chemistry. Topological indices derived from graph representations of molecules enable us to predict various properties of these compounds, including their physical characteristics, chemical reactivity, biological activity, toxicity, and atom-to-atom interactions. More recently, graphs have also been utilized to depict abstract mathematical objects such as groups. A notable example of graph representation in group theory is seen in power graphs. This research explores new graph topological indices b

APA, Harvard, Vancouver, ISO, and other styles

8

Jin, Ming, Heng Chang, Wenwu Zhu, and Somayeh Sojoudi. "Power up! Robust Graph Convolutional Network via Graph Powering." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 9 (2021): 8004–12. http://dx.doi.org/10.1609/aaai.v35i9.16976.

Full text

Abstract:

Graph convolutional networks (GCNs) are powerful tools for graph-structured data. However, they have been recently shown to be vulnerable to topological attacks. To enhance adversarial robustness, we go beyond spectral graph theory to robust graph theory. By challenging the classical graph Laplacian, we propose a new convolution operator that is provably robust in the spectral domain and is incorporated in the GCN architecture to improve expressivity and interpretability. By extending the original graph to a sequence of graphs, we also propose a robust training paradigm that encourages transfe

APA, Harvard, Vancouver, ISO, and other styles

9

Zahirović, Samir, Ivica Bošnjak, and Rozália Madarász. "A study of enhanced power graphs of finite groups." Journal of Algebra and Its Applications 19, no. 04 (2019): 2050062. http://dx.doi.org/10.1142/s0219498820500620.

Full text

Abstract:

The enhanced power graph [Formula: see text] of a group [Formula: see text] is the graph with vertex set [Formula: see text] such that two vertices [Formula: see text] and [Formula: see text] are adjacent if they are contained in the same cyclic subgroup. We prove that finite groups with isomorphic enhanced power graphs have isomorphic directed power graphs. We show that any isomorphism between undirected power graph of finite groups is an isomorphism between enhanced power graphs of these groups, and we find all finite groups [Formula: see text] for which [Formula: see text] is abelian, all f

APA, Harvard, Vancouver, ISO, and other styles

10

Ma, Xuanlong, Ruiqin Fu, Xuefei Lu, Mengxia Guo, and Zhiqin Zhao. "Perfect codes in power graphs of finite groups." Open Mathematics 15, no. 1 (2017): 1440–49. http://dx.doi.org/10.1515/math-2017-0123.

Full text

Abstract:

Abstract The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the group, in which two vertices are adjacent if they generate a cyclic subgroup. In this paper, we give a complete description of finite groups with enhanced power graphs admitting a perfect code. In addition, we describe all groups in the following two classes of finite groups: the class of groups with power graphs admitting a total perfec

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Power graph"

1

Zhang, Jiaxin. "Power-law Graph Cuts." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1418749967.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Antonopoulos, Timos. "Expressive power of graph languages." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611490.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Livesay, Neal. "The Inner Power of a Graph." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2057.

Full text

Abstract:

We define a new graph operation called the inner power of a graph. The construction is similar to the direct power of graphs, except that factors are intertwined in such a way that certain structural properties of graphs are more clearly reflected in their inner powers. We investigate various properties of inner powers, such as connectivity, bipartiteness, and their interaction with the direct product. We explore possible connections between inner powers and the problem of cancellation over the direct product of graphs.

APA, Harvard, Vancouver, ISO, and other styles

4

Pedersen, Tom Arne. "Bond Graph Modeling of Marine Power Systems." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for marin teknikk, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-5494.

Full text

Abstract:

Mathematical models for an All Electric Ship component library is developed in this thesis. The main motivation for writing this thesis is to develop a model library that gives the opportunity to simulate both existing and new machinery systems without having to remodel the entire system each time. The model library should support the process of modeling and reuse, and also emphasize openness to brace the modeler during the development and refinement phase. The bond graph approach is good when it comes to physical modeling of systems, it is a good tool for combining different energy domains an

APA, Harvard, Vancouver, ISO, and other styles

5

McLaughlin, Adam Thomas. "Power-constrained performance optimization of GPU graph traversal." Thesis, Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50209.

Full text

Abstract:

Graph traversal represents an important class of graph algorithms that is the nucleus of many large scale graph analytics applications. While improving the performance of such algorithms using GPUs has received attention, understanding and managing performance under power constraints has not yet received similar attention. This thesis first explores the power and performance characteristics of breadth first search (BFS) via measurements on a commodity GPU. We utilize this analysis to address the problem of minimizing execution time below a predefined power limit or power cap exposing key rela

APA, Harvard, Vancouver, ISO, and other styles

6

Eslamdoost, V. "Bond graph modelling of power electronic switching circuits." Thesis, University of Nottingham, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Cerda, Jacobo Jaime. "A decentralised graph-based framework for electrical power markets." Thesis, University of Southampton, 2010. https://eprints.soton.ac.uk/161933/.

Full text

Abstract:

One of the main tools used to clear the electrical power market across the world is the DC optimal power flow. Nevertheless, the classical model designed for vertically integrated power systems is now under pressure as new issues such as partial information introduced by the deregulation process, scalability posed by the multiple small renewable generation units as well as microgrids, and markets integration have to be addressed. This dissertation presents a graph-based decentralised framework for the electricity power market based on the DC optimal power flow where Newton's method is solved u

APA, Harvard, Vancouver, ISO, and other styles

8

Pennarun, Claire. "Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0609/document.

Full text

Abstract:

Dans cette thèse, nous présentons trois problèmes concernant les graphes planaires.Nous travaillons tout d'abord sur les dessins planaires non-alignés, c'est-à-dire des dessins planaires de graphes sur une grille sans que deux sommets se trouvent sur la même ligne ou la même colonne.Nous caractérisons les graphes planaires possédant un tel dessin sur une grille de taille $n times n$, et nous présentons deux algorithmes générant un dessin planaire non-aligné avec arêtes brisées sur cette grille pour tout graphe planaire, avec $n-3$ ou $min(frac{2n-3}{5},$ $#{text{triangles s{'e}parateurs}}+1)$

APA, Harvard, Vancouver, ISO, and other styles

9

Walker, DayVon L. "Power Graphs of Quasigroups." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7984.

Full text

Abstract:

We investigate power graphs of quasigroups. The power graph of a quasigroup takes the elements of the quasigroup as its vertices, and there is an edge from one element to a second distinct element when the second is a left power of the first. We first compute the power graphs of small quasigroups (up to four elements). Next we describe quasigroups whose power graphs are directed paths, directed cycles, in-stars, out-stars, and empty. We do so by specifying partial Cayley tables, which cannot always be completed in small examples. We then consider sinks in the power graph of a quasigroup,

APA, Harvard, Vancouver, ISO, and other styles

10

Samir, Zahirović. "Algebarska i kombinatorna svojstva grafova pridruzenih stepeno-asocijativnim grupoidima." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2020. https://www.cris.uns.ac.rs/record.jsf?recordId=114438&source=NDLTD&language=en.

Full text

Abstract:

Usmereni stepeni graf ~G(G) grupe G uveli su Kelarev i Quinn [37] kao digraf sa skupom cvorova G u kome je x ! y ako je y stepen elementa x, a stepeni graf G(G) je odgovarajuci prost graf, i njega su prvi proucavali Chakrabarty, Ghosh i Sen [17]. Obogaceni stepeni graf G e(G) od G, koji je uveden u [1], je prost graf  sa istim skupom cvorova u kome su dva cvora susedna ako su oba stepeni nekog elementa te grupe.U disertaciji su predstavljeni dokazi iz [12] i [73] da se, za konacnu stepenoasocijativnu lupu G sa inverzima, ~ G(G), G(G) i G e(G) medusobno odreduju. Ovo povlaci da sva tri nav

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Power graph"

1

Zhu, Jizhong. Power systems applications of graph theory. Nova Science Publishers, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Moreno Chuquen, Ricardo, and Harold R. Chamorro. Graph Theory Applications to Deregulated Power Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-57589-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Madani, Seyed Mohammad. Analysis and design of power system protections using graph theory. Technische Universiteit Eindhoven, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Robert, Mitchell. Contemporary's number power: Graphs, charts, schedules, and maps. Contemporary Books, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Robert, Mitchell. Number power 5: Graphs, tables, schedules, and maps. Edited by Prickel Donald. Contemporary Books, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Donald, Prickel, ed. Number power 5: Graphs, tables, schedules, and maps. Contemporary Books, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

T, Smith Robert. Calculus: Late transcendental functions. 4th ed. McGraw-Hill, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Acosta, Maribel, Philippe Cudré-Mauroux, Maria Maleshkova, Tassilo Pellegrini, Harald Sack, and York Sure-Vetter, eds. Semantic Systems. The Power of AI and Knowledge Graphs. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-33220-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bedane, Tesfaye Lema. Basic mathematics for grade 9 algebra and geometry: Graphs of basic power and rational functions. Trafford Publishing, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dai, Renchang. Graph Database and Graph Computing for Power System Analysis. Wiley & Sons, Incorporated, John, 2023.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Power graph"

1

Andersen, Reid, Fan Chung, and Lincoln Lu. "Drawing Power Law Graphs." In Graph Drawing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bloom, Niels. "Applying Power Graph Analysis to Weighted Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28997-2_61.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Drewes, Frank, Berthold Hoffmann, and Mark Minas. "Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power." In Graph Transformation. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09843-7_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Paris, Gilles. "Automatic drawing of compound digraphs for a real-time power system simulator." In Graph Drawing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0021826.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Priya, K., G. Mahadevan, C. Sivagnanam, and Sanjay Kumar Tyagi. "CTATD Number for Power Graph of Some Special Graphs and Tadpole Graph." In Springer Proceedings in Mathematics & Statistics. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-2640-0_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gurski, Frank, and Egon Wanke. "The Clique-Width of Tree-Power and Leaf-Power Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74839-7_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Angel, Eric, Evripidis Bampis, Bruno Escoffier, and Michael Lampis. "Parameterized Power Vertex Cover." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53536-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pokorný, Jaroslav. "Graph Databases: Their Power and Limitations." In Computer Information Systems and Industrial Management. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24369-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

van den Brink, René, Gerard van der Laan, Marina Uzunova, and Valeri Vasil’ev. "Political Power on a Line Graph." In Studies in Choice and Welfare. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21696-1_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dabrowski, Konrad K., Tomáš Masařík, Jana Novotná, Daniël Paulusma, and Paweł Rzążewski. "Clique-Width: Harnessing the Power of Atoms." In Graph-Theoretic Concepts in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-60440-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Power graph"

1

Poole, Benjamin, Rajan Ratnakumar, Dulip Tharaka Madurasinghe, Christian Kümmerle, Ganesh Kumar Venayagamoorthy, and Minwoo Lee. "Data-Driven Graph Construction of Power Flow Graphs for Electric Power Transmission Networks." In 2024 International Conference on Machine Learning and Applications (ICMLA). IEEE, 2024. https://doi.org/10.1109/icmla61862.2024.00053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Shuowei, Sifan Ding, and William Zhu. "Deep Graph Matching with Improved Graph-Context Networks based by Attention." In 2024 International Conference on Artificial Intelligence and Power Systems (AIPS). IEEE, 2024. http://dx.doi.org/10.1109/aips64124.2024.00041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Shaohua, and Qi Zhou. "Application Research of Graph Embedding Method Based on Heterogeneous Graph." In 2024 IEEE 6th International Conference on Power, Intelligent Computing and Systems (ICPICS). IEEE, 2024. https://doi.org/10.1109/icpics62053.2024.10797011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Chunying, Zhilei Wang, Lijie Wu, Yan Liu, Huifang Liu, and Ruijie Zhu. "Fault Diagnosis for Power Backbone Networks based on Graph-Gated Knowledge Graph." In 2024 22nd International Conference on Optical Communications and Networks (ICOCN). IEEE, 2024. http://dx.doi.org/10.1109/icocn63276.2024.10648538.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mu, Juntao, Shengcheng Song, Lijuan Ye, et al. "Knowledge Graph Construction for Secondary Equipment Fault Diagnosis Based on Graph Attention." In 2024 International Conference on Artificial Intelligence and Power Systems (AIPS). IEEE, 2024. http://dx.doi.org/10.1109/aips64124.2024.00012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

S, Adarsh, and Joseph Zacharias. "Handling Missing Data in Graph Networks with Adaptive Graph Convolutional Network." In 2024 International Conference on Advancements in Power, Communication and Intelligent Systems (APCI). IEEE, 2024. http://dx.doi.org/10.1109/apci61480.2024.10616601.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Xu, Feifei, Yumeng Zhang, and Yifei Li. "Graph Neural Network Algorithm Based on Graph Convolution and Attention Mechanism." In 2025 IEEE 5th International Conference on Power, Electronics and Computer Applications (ICPECA). IEEE, 2025. https://doi.org/10.1109/icpeca63937.2025.10928730.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jiangang, Lu, Tan Huijuan, Zhao Ruifeng, Guo Wenxin, Dai Zhen, and Li Ping. "Applications of Graph Computing and Graph Neural Networks in Power Systems: A Survey." In 2024 China International Conference on Electricity Distribution (CICED). IEEE, 2024. http://dx.doi.org/10.1109/ciced63421.2024.10754312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lowery, Luke, and Adam B. Birchfield. "EMT Simulation with Spectral Graph Wavelets." In 2025 IEEE Texas Power and Energy Conference (TPEC). IEEE, 2025. https://doi.org/10.1109/tpec63981.2025.10906951.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zeng, Dejun, Yun Zhao, and Zhiyuan Yang. "Construction of Safety Knowledge Graph for Near Electric Work Based on Graph Visualization." In 2024 5th International Conference on Clean Energy and Electric Power Engineering (ICCEPE). IEEE, 2024. https://doi.org/10.1109/iccepe62686.2024.10931541.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Power graph"

1

Li, Wenting. Robust Fault Location in Power Grids through Graph Learning at Low Label Rates. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1768426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bambha, Neal K., and Shuvra S. Bhattacharyya. A Joint Power/Performance Optimization Algorithm for Multiprocessor Systems Using a Period Graph Construct. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada456719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ramakrishnan, Aravind, Fangyu Liu, Angeli Jayme, and Imad Al-Qadi. Prediction of Pavement Damage under Truck Platoons Utilizing a Combined Finite Element and Artificial Intelligence Model. Illinois Center for Transportation, 2024. https://doi.org/10.36501/0197-9191/24-030.

Full text

Abstract:

For robust pavement design, accurate damage computation is essential, especially for loading scenarios such as truck platoons. Studies have developed a framework to compute pavement distresses as function of lateral position, spacing, and market-penetration level of truck platoons. The established framework uses a robust 3D pavement model, along with the AASHTOWare Mechanistic–Empirical Pavement Design Guidelines (MEPDG) transfer functions to compute pavement distresses. However, transfer functions include high variability and lack physical significance. Therefore, as an improvement to effecti

APA, Harvard, Vancouver, ISO, and other styles

4

Zhao, L. A Routing Protocol for Low-Power and Lossy Networks (RPL) Destination-Oriented Directed Acyclic Graph (DODAG) Configuration Option for the 6LoWPAN Routing Header. Edited by P. Thubert. RFC Editor, 2021. http://dx.doi.org/10.17487/rfc9035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Abou-rjeili, Amine, and George Karypis. Multilevel Algorithms for Partitioning Power-Law Graphs. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada439402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Silva, Catia, Ricardo Bessa, Erika Pequeno, et al. Dynamic Factor Graphs - A New Wind Power Forecasting Approach. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1165671.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Thomas, Samuel, Elaine Baker, Kamal Aryal, et al. Towards Climate Resilient Agriculture in Nepal: Solutions for smallholder farmers. International Centre for Integrated Mountain Development (ICIMOD), 2024. https://doi.org/10.53055/icimod.1077.

Full text

Abstract:

Nepal, one of the world’s most climate-vulnerable countries, is facing severe impacts from climate change, particularly in its agricultural sector, which employs two-thirds of the population and contributes more than a quarter of the nation’s GDP. Smallholder farmers, the backbone of this sector, are grappling with rising temperatures, erratic monsoon patterns, droughts, and increasingly frequent extreme weather events. Adapting to these challenges through Climate-Resilient Agriculture (CRA) is essential to ensuring food security and safeguarding the livelihoods of millions. CRA incorporates n

APA, Harvard, Vancouver, ISO, and other styles

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!