Log in

Relevant bibliographies by topics / Power graph / Journal articles

To see the other types of publications on this topic, follow the link: Power graph.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

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

Full text

Abstract:

Abstract <strong>Objective:</strong> Finding the triple connected certified domination number for the power graph of some peculiar graphs. <strong>Methods:</strong> 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

APA, Harvard, Vancouver, ISO, and other styles

12

Kuriachan, Geethu, and A. Parthiban. "On Graph Entropy Measures Based on the Number of Dominating and Power Dominating Sets." Malaysian Journal of Mathematical Sciences 19, no. 1 (2025): 269–87. https://doi.org/10.47836/mjms.19.1.14.

Full text

Abstract:

This article examines graph entropy measures that depend on the number of dominating and power-dominating sets. To quantify the structural complexity of a graph structure, one uses graph entropies. It is easy to compute these properties for smaller networks, and if reliable approximations are developed, similar metrics can also be used for larger graphs. Using various graph invariants, many graph entropy measures have already been established and computed. So, in this work, a new graph entropy measure, namely, power domination entropy, using the power domination polynomial, is introduced. The

APA, Harvard, Vancouver, ISO, and other styles

13

Praveenkumar, L., G. Mahadevan, and C. Sivagnanam. "Generalization of CD-Number for Power Graph of Some Special Types of Tree Graphs." Indian Journal Of Science And Technology 17, SPI1 (2024): 109–14. http://dx.doi.org/10.17485/ijst/v17sp1.223.

Full text

Abstract:

Objectives: The main objective of the article is to finding the corona domination for the power graph of some special types of tree graph. Method: A dominating set of a graph is said to be a corona dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality of a corona dominating set is called the corona domination number and is denoted by . Findings: In this article, we study the -number for the power of PVB-tree and where and identify their exact values. Novelty: The corona domination was one of the recently developed domination parameter, along

APA, Harvard, Vancouver, ISO, and other styles

14

Saifudin, Ilham. "Power Domination Number On Shackle Operation with Points as Lingkage." JTAM | Jurnal Teori dan Aplikasi Matematika 4, no. 1 (2020): 1. http://dx.doi.org/10.31764/jtam.v4i1.1579.

Full text

Abstract:

The Power dominating set is a minimum point of determination in a graph that can dominate the connected dots around it, with a minimum domination point. The smallest cardinality of a power dominating set is called a power domination number with the notation . The purpose of this study is to determine the Shackle operations graph value from several special graphs with a point as a link. The result operation graphs are: Shackle operation graph from Path graph , Shackle operation graph from Sikel graph , Shackle operation graph from Star graph . The method used in this paper is axiomatic deductiv

APA, Harvard, Vancouver, ISO, and other styles

15

Abdul Basit Khilji *, Murtaza Ali та Muhammad Irfan. "On the Domination Number of the Splitting Graph of C_ξ^κ". Physical Education, Health and Social Sciences 3, № 2 (2025): 89–95. https://doi.org/10.63163/jpehss.v3i2.484.

Full text

Abstract:

This paper explores the domination number of the splitting graph associated with higher powers of cycle graphs. We begin by computing the domination number of the splitting graph of the square and cube of the cycle graph C_ξ. Through analysis and observed patterns, we propose a general conjecture regarding the domination number of the splitting graph of the κ^th power ofC_ξ. These results extend the existing work on domination parameters in transformed graphs and provide a foundation for further theoretical development and applications.

APA, Harvard, Vancouver, ISO, and other styles

16

Zhang, Cui, Jiangtao Shi, and Wujie Shi. "Two Sufficient Conditions for Vertex-transitive Hamilton Graphs of Prime-power Order." Algebra Colloquium 16, no. 03 (2009): 525–34. http://dx.doi.org/10.1142/s1005386709000492.

Full text

Abstract:

A Hamilton cycle in a graph is a cycle going through all vertices of the graph, and a graph is said to be a Hamilton graph if it has a Hamilton cycle. In this article, two sufficient conditions for vertex-transitive Hamilton graphs of prime-power order are given. Using these conditions, two infinite families of Hamilton graphs of order a 2-power are constructed.

APA, Harvard, Vancouver, ISO, and other styles

17

Jafari, S. H. "Some properties of power graphs in finite group." Asian-European Journal of Mathematics 09, no. 04 (2016): 1650079. http://dx.doi.org/10.1142/s1793557116500790.

Full text

Abstract:

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We prove some beautiful results in power graphs of finite groups. Then we conclude two finite groups with isomorphic power graphs have the same number of elements of each order from the different way of [P. J. Cameron, The power graph of a finite group II, J. Group Theory 13 (2010) 779–783].

APA, Harvard, Vancouver, ISO, and other styles

18

ZHOU, JIN-XIN, and YAN-QUAN FENG. "TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER." Journal of the Australian Mathematical Society 88, no. 2 (2010): 277–88. http://dx.doi.org/10.1017/s1446788710000066.

Full text

Abstract:

AbstractA graph is s-transitive if its automorphism group acts transitively on s-arcs but not on (s+1)-arcs in the graph. Let X be a connected tetravalent s-transitive graph of order twice a prime power. In this paper it is shown that s=1,2,3 or 4. Furthermore, if s=2, then X is a normal cover of one of the following graphs: the 4-cube, the complete graph of order 5, the complete bipartite graph K5,5 minus a 1-factor, or K7,7 minus a point-hyperplane incidence graph of the three-dimensional projective geometry PG(2,2); if s=3, then X is a normal cover of the complete bipartite graph of order 4

APA, Harvard, Vancouver, ISO, and other styles

19

Ma, Xuanlong. "Forbidden Subgraphs in Intersection Power Graphs of Finite Groups." Algebra Colloquium 32, no. 01 (2025): 95–110. https://doi.org/10.1142/s1005386725000094.

Full text

Abstract:

The intersection power graph of a finite group [Formula: see text] is a simple graph whose vertex set is [Formula: see text], in which two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if either one of [Formula: see text] and [Formula: see text] is the identity element, or [Formula: see text] is non-trivial. A number of important graph classes, including cographs, chordal graphs, split graphs, and threshold graphs, can be defined either structurally or in terms of forbidden induced subgraphs. In this paper, we characterize the finite groups whose inters

APA, Harvard, Vancouver, ISO, and other styles

20

Nacaroglu, Yasar, Nihat Akgunes, Sedat Pak, and I. Naci Cangul. "SOME GRAPH PARAMETERS OF POWER SET GRAPHS." Advances and Applications in Discrete Mathematics 26, no. 2 (2021): 211–19. http://dx.doi.org/10.17654/dm026020211.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

M.Kaaviya, Shree, and K.Sharmilaa. "Power-3 Heronian Mean Labeling of Graphs." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 4 (2020): 1359–61. https://doi.org/10.35940/ijeat.D7831.049420.

Full text

Abstract:

Let be an undirected graph having vertices and edges. Now, defining a function say, is called Power-3 Heronian Mean Labeling of a graph if we could able to label the vertices with dissimilar elements from such that it induces an edge labeling defined as, is dissimilar for all the edges (i,e.) It intimates that the dissimilar vertex labeling induces a dissimilar edge labeling on the graph. The graph which owns Power-3 Heronian Mean Labeling is called an Power-3 Heronian Mean Graph. In this, we have advocated the Power-3 Heronian Mean Labeling of some standard graphs like Path, Comb, Caterpillar

APA, Harvard, Vancouver, ISO, and other styles

22

Ejima, O., K. O. Aremu, and A. Yusuf. "The order divisor-power graph of finite groups." Annals of the Alexandru Ioan Cuza University - Mathematics 71, no. 2 (2025): 133. https://doi.org/10.47743/anstim.2025.00010.

Full text

Abstract:

Let G be a finite group. In this paper, we introduce the order divisor-power graph Γodp(G) associated with G as the simple undirected graph whose vertices are the elements of G and such that two vertices a, b a̸ = b are adjacent if one is a power of the other and their orders are different. We investigate some algebraic properties and combinatorial structures of the order divisor-power graph Γodp(G) and obtain the conditions under which the order divisor-power graph Γodp(G) can be a star graph. Also, we exhibit some connection between the order divisor-power graph and the power graph of dihedr

APA, Harvard, Vancouver, ISO, and other styles

23

Kuo, Jyhmin, and Wei-Lun Wu. "Power domination in generalized undirected de Bruijn graphs and Kautz graphs." Discrete Mathematics, Algorithms and Applications 07, no. 01 (2015): 1550003. http://dx.doi.org/10.1142/s1793830915500032.

Full text

Abstract:

To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set P is a power dominating set (PDS) of a graph G = (V, E), if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number γp(G). In this paper, we determine the upper bounds of power domination number of generalized undirected de Bruijn graphs and generalized undirected Kau

APA, Harvard, Vancouver, ISO, and other styles

24

Abudayah, Mohammad, Omar Alomari, and Hassan Ezeh. "Geodetic Number of Powers of Cycles." Symmetry 10, no. 11 (2018): 592. http://dx.doi.org/10.3390/sym10110592.

Full text

Abstract:

The geodetic number of a graph is an important graph invariant. In 2002, Atici showed the geodetic set determination of a graph is an NP-Complete problem. In this paper, we compute the geodetic set and geodetic number of an important class of graphs called the k-th power of a cycle. This class of graphs has various applications in Computer Networks design and Distributed computing. The k-th power of a cycle is the graph that has the same set of vertices as the cycle and two different vertices in the k-th power of this cycle are adjacent if the distance between them is at most k.

APA, Harvard, Vancouver, ISO, and other styles

25

Guo, Tong. "Research and Applications of Knowledge Graphs in the Power Sector: A Review." Journal of Energy Research and Reviews 16, no. 11 (2024): 28–43. http://dx.doi.org/10.9734/jenrr/2024/v16i11380.

Full text

Abstract:

With the rapid development of science and technology, power system has become the lifeblood of modern society, an increasingly large power system complicates the management, operation, and maintenance of the grid. In order to effectively use a large number of operating data and prior knowledge of power system, the knowledge graph is introduced into the field of power systems. This paper introduces the research and application of knowledge graph in power system and emphasizes the importance of knowledge graphs in addressing the increasing complexity of power systems and the rising demand for in

APA, Harvard, Vancouver, ISO, and other styles

26

Gazir S, Abdul, I. Gede Adhitya Wisnu Wardhana, Ni Wayan Switrayni, and Qurratul Aini. "Some Properties of Coprime Graph of Dihedral Group D_2n When n is a Prime Power." Journal of Fundamental Mathematics and Applications (JFMA) 3, no. 1 (2020): 34–38. http://dx.doi.org/10.14710/jfma.v3i1.7413.

Full text

Abstract:

The Study of algebraic structures, especially on graphs theory, leads to anew topics of research in recent years. In this paper, the algebraic structures that will be represented by a coprime graph are the dihedral group and its subgroups. The coprime graph of a group G, denoted by \Gamma_D_2n is a graph whose vertices are elements of G and two distinct vertices a and b are adjacent if only if (|a,|b|)=1. Some properties of the coprime graph of a dihedral group D_2n are obtained. One of the results is if n is prime then \Gamma_D_2n is a complete bipartite graph. Moreover, if n is the power of

APA, Harvard, Vancouver, ISO, and other styles

27

Asmarani, Evi Yuniartika, Sahin Two Lestari, Dara Purnamasari, Abdul Gazir Syarifudin, Salwa Salwa, and I. Gede Adhitya Wisnu Wardhana. "The First Zagreb Index, The Wiener Index, and The Gutman Index of The Power of Dihedral Group." CAUCHY: Jurnal Matematika Murni dan Aplikasi 7, no. 4 (2023): 513–20. http://dx.doi.org/10.18860/ca.v7i4.16991.

Full text

Abstract:

Research on graphs combined with groups is an interesting topic in the field of combinatoric algebra where graphs are used to represent a group. One type of graph representation of a group is a power graph. A power graph of the group G is defined as a graph whose vertex set is all elements of G and two distinct vertices a and b are adjacent if and only if or for a positive integer and . In addition to mathematics, graph theory can be applied to various fields of science, one of which is chemistry, which is related to topological indices. In this study, the topological indexes will be discussed

APA, Harvard, Vancouver, ISO, and other styles

28

Yu, Liren, Jiaming Xu, and Xiaojun Lin. "The Power of D-hops in Matching Power-Law Graphs." ACM SIGMETRICS Performance Evaluation Review 49, no. 1 (2022): 77–78. http://dx.doi.org/10.1145/3543516.3460098.

Full text

Abstract:

This paper studies seeded graph matching for power-law graphs. Assume that two edge-correlated graphs are independently edge-sampled from a common parent graph with a power-law degree distribution. A set of correctly matched vertex-pairs is chosen at random and revealed as initial seeds. Our goal is to use the seeds to recover the remaining latent vertex correspondence between the two graphs. Departing from the existing approaches that focus on the use of high-degree seeds in $1$-hop neighborhoods, we develop an efficient algorithm that exploits the low-degree seeds in suitably-defined D-hop n

APA, Harvard, Vancouver, ISO, and other styles

29

Yu, Liren, Jiaming Xu, and Xiaojun Lin. "The Power of D-hops in Matching Power-Law Graphs." Proceedings of the ACM on Measurement and Analysis of Computing Systems 5, no. 2 (2021): 1–43. http://dx.doi.org/10.1145/3460094.

Full text

Abstract:

This paper studies seeded graph matching for power-law graphs. Assume that two edge-correlated graphs are independently edge-sampled from a common parent graph with a power-law degree distribution. A set of correctly matched vertex-pairs is chosen at random and revealed as initial seeds. Our goal is to use the seeds to recover the remaining latent vertex correspondence between the two graphs. Departing from the existing approaches that focus on the use of high-degree seeds in $1$-hop neighborhoods, we develop an efficient algorithm that exploits the low-degree seeds in suitably-defined D-hop n

APA, Harvard, Vancouver, ISO, and other styles

30

Jain, Vivek, and Pradeep Kumar. "A note on the power graphs of finite nilpotent groups." Filomat 34, no. 7 (2020): 2451–61. http://dx.doi.org/10.2298/fil2007451j.

Full text

Abstract:

The power graph P(G) of a group G is the graph with vertex set G and two distinct vertices are adjacent if one is a power of the other. Two finite groups are said to be conformal, if they contain the same number of elements of each order. Let Y be a family of all non-isomorphic odd order finite nilpotent groups of class two or p-groups of class less than p. In this paper, we prove that the power graph of each group in Y is isomorphic to the power graph of an abelian group and two groups in Y have isomorphic power graphs if they are conformal. We determine the number of maximal cyclic subgroups

APA, Harvard, Vancouver, ISO, and other styles

31

Ghorbani, Modjtaba, and Fatemeh Abbasi-Barfaraz. "On the characteristic polynomial of power graphs." Filomat 32, no. 12 (2018): 4375–87. http://dx.doi.org/10.2298/fil1812375g.

Full text

Abstract:

The power graph P(G) of finite group G is a graph whose vertex set is G and two distinct vertices are adjacent if one is a power of the other. In this paper, we determine the characteristic polynomial of the power graphs of groups of order a product of three primes.

APA, Harvard, Vancouver, ISO, and other styles

32

Feng, Yan-Quan, and Jin Ho Kwak. "Cubic symmetric graphs of order twice an odd prime-power." Journal of the Australian Mathematical Society 81, no. 2 (2006): 153–64. http://dx.doi.org/10.1017/s1446788700015792.

Full text

Abstract:

AbstractAn automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. For a connected cubic symmetric graph X of order 2pn for an odd prime p, we show that if p ≠ 5, 7 then every Sylow p-subgroup of the full automorphism group Aut(X) of X is normal, and if p ≠3 then every s-regular subgroup of Aut(X) having a normal Sylow p-subgroup contains an (s − 1)-regular subgroup for each 1 ≦ s ≦ 5. As an application, we show that every connected cubic symmetric graph of order 2pn is a Cay

APA, Harvard, Vancouver, ISO, and other styles

33

K.Kalaiarasi and R.Divya. "Fuzzy Colouring of Interval-Valued Fuzzy Graph." International Journal of Fuzzy Mathematical Archive 14, no. 01 (2017): 47–57. http://dx.doi.org/10.22457/ijfma.v14n1a7.

Full text

Abstract:

Fuzzy graphs have revolutionized the analysis of problematic data to arrive at a better decision making power are different kinds. Among them, the interval-valued fuzzy graph in the simplest and generalized once. The main purpose of this paper is to introduce the chromatic number of an interval-valued fuzzy graph. Here working rule of an interval-valued fuzzy graph, power cut graph are discussed.

APA, Harvard, Vancouver, ISO, and other styles

34

Abd El-hay, Atef, Khalid A. Alsatami, and Ashraf Elrokh. "A Novel Problem and Algorithm for Solving Cordial Labeling of Some Fifth Powers of Graphs." European Journal of Pure and Applied Mathematics 18, no. 1 (2025): 5812. https://doi.org/10.29020/nybg.ejpam.v18i1.5812.

Full text

Abstract:

In this paper we introduce a novel application of cordial labeling using the fifth power of graphs, demonstrating its potential for understanding and studying specific graph structures. The resulting cordial labeling scheme for the fifth power of paths, cycles, fans, wheels, lemniscate and the union of fifth power of paths and cycles graphs can provide insights into the properties and structures of these graphs. It can be used to analyze its connectivity, symmetry, and other graph-theoretical characteristics.

APA, Harvard, Vancouver, ISO, and other styles

35

Panda, Ramesh Prasad, and K. V. Krishna. "On connectedness of power graphs of finite groups." Journal of Algebra and Its Applications 17, no. 10 (2018): 1850184. http://dx.doi.org/10.1142/s0219498818501840.

Full text

Abstract:

The power graph of a group [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of [Formula: see text]-groups are studied. In particular, the number of components of that of abelian [Formula: see text]-groups are deter

APA, Harvard, Vancouver, ISO, and other styles

36

Shanmuganathan, Hemappriya, Hazzirah Izzati Mat Hassim, and Alshammari Maryam Fahd A. "The Union Prime Power Order Cayley Graph of Certain Cyclic Groups and their Topological Indices." Semarak International Journal of Fundamental and Applied Mathematics 4, no. 1 (2024): 32–47. https://doi.org/10.37934/sijfam.4.1.3247.

Full text

Abstract:

Cayley graph is a variation of graphs that focuses on constructing and analyzing graphs using algebraic structures. Meanwhile, topological indices of graphs are numerical values that reflect various aspects of the graphs’ structure. Over the years, many variants of Cayley graphs have been constructed due to the significance of understanding the order of elements within a group’s subset but not on the union of subsets with specific order of elements. In this paper, a new variant of Cayley graph, namely the union prime power order Cayley graph of a group with respect to subset is formed by combi

APA, Harvard, Vancouver, ISO, and other styles

37

Leri, Marina, and Yury Pavlov. "Power-Law Random Graphs’ Robustness: Link Saving and Forest Fire Model." Austrian Journal of Statistics 43, no. 4 (2014): 229–36. http://dx.doi.org/10.17713/ajs.v43i4.34.

Full text

Abstract:

We consider random graphs with node degrees drawn independently from a power- law distribution. By computer simulation we study two aspects of graph robustness: preserving graph connectivity and node saving in the forest fire model, considering two types of graph destruction: the removal of nodes with the highest degrees and equiprobable node extraction.

APA, Harvard, Vancouver, ISO, and other styles

38

Abbas, Ghulam, Usman Ali, Mobeen Munir, Syed Ahtsham Ul Haq Bokhary, and Shin Min Kang. "Power graphs and exchange property for resolving sets." Open Mathematics 17, no. 1 (2019): 1303–9. http://dx.doi.org/10.1515/math-2019-0093.

Full text

Abstract:

Abstract Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given. A sufficient condition for the graph to have the exchange property for resolving sets is found. Consequently, every minimal resolving set in the graph forms a basis for a matriod in the context of independence defined by Boutin [Determining sets, resolving set and the exchange property, Graphs Combin., 2009, 25, 789-806]. Also, a new way to def

APA, Harvard, Vancouver, ISO, and other styles

39

Aiello, William, Fan Chung, and Linyuan Lu. "A Random Graph Model for Power Law Graphs." Experimental Mathematics 10, no. 1 (2001): 53–66. http://dx.doi.org/10.1080/10586458.2001.10504428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Daneshgar, Amir, and Hossein Hajiabolhassan. "Density and power graphs in graph homomorphism problem." Discrete Mathematics 308, no. 17 (2008): 4027–30. http://dx.doi.org/10.1016/j.disc.2007.07.090.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Pourghobadi, Kobra, and Sayyed Heidar Jafari. "The diameter of power graphs of symmetric groups." Journal of Algebra and Its Applications 17, no. 12 (2018): 1850234. http://dx.doi.org/10.1142/s0219498818502341.

Full text

Abstract:

The power graph of a group [Formula: see text] is the simple graph [Formula: see text], with vertex-set [Formula: see text] and vertices [Formula: see text] and [Formula: see text] are adjacent, if and only if [Formula: see text] and either [Formula: see text] or [Formula: see text] for some positive integer [Formula: see text]. The proper power graph of [Formula: see text], denoted [Formula: see text], is the graph obtained from [Formula: see text] by deleting the vertex [Formula: see text]. In [On the connectivity of proper power graphs of finite groups, Comm. Algebra 43 (2015) 4305–4319], i

APA, Harvard, Vancouver, ISO, and other styles

42

Agnarsson, Geir. "On chordal graphs and their chromatic polynomials." MATHEMATICA SCANDINAVICA 93, no. 2 (2003): 240. http://dx.doi.org/10.7146/math.scand.a-14421.

Full text

Abstract:

We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the chromatic polynomial for an arbitrary power of a graph which belongs to any given class of chordal graphs that are closed under taking powers.

APA, Harvard, Vancouver, ISO, and other styles

43

Yusuf, Anas, та Almustapha Umar. "On Power Graph Representation of Γ_1-nonderanged Permutation Group". UMYU Scientifica 4, № 1 (2025): 53–61. https://doi.org/10.56919/usci.2541.006.

Full text

Abstract:

Study’s Excerpt: An undirected power graph representation of -nonderanged permutation group has been constructed. Ithas been proved that is connected for any and is neither regular nor complete except at The adjacency matrix of some selected graphs together with pictorial representations was also Full Abstract: A -nonderanged permutation group is a permutation group such that where . In this paper, an undirected power graph representation of -nonderanged permutation group denoted by has been studied. It was proved, among other things, that the graph is connected for any and is neither regular

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, X. Y., A. R. Moghaddamfar, and M. Zohourattar. "Some properties of various graphs associated with finite groups." Algebra and Discrete Mathematics 31, no. 2 (2021): 195–211. http://dx.doi.org/10.12958/adm1197.

Full text

Abstract:

In this paper we investigate some properties of the power graph and commuting graph associated with a finite group, using their tree-numbers. Among other things, it is shown that the simple group L2(7) can be characterized through the tree-number of its power graph. Moreover, the classification of groups with power-free decomposition is presented. Finally, we obtain an explicit formula concerning the tree-number of commuting graphs associated with the Suzuki simple groups.

APA, Harvard, Vancouver, ISO, and other styles

45

Hamzeh, Asma, and Ali Ashrafi. "Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups." Filomat 31, no. 16 (2017): 5323–34. http://dx.doi.org/10.2298/fil1716323h.

Full text

Abstract:

Let G be a finite group. The power graph P(G) and its main supergraph S(G) are two simple graphs with the same vertex set G. Two elements x,y ? G are adjacent in the power graph if and only if one is a power of the other. They are joined in S(G) if and only if o(x)|o(y) or o(y)|o(x). The aim of this paper is to compute the characteristic polynomial of these graph for certain finite groups. As a consequence, the spectrum and Laplacian spectrum of these graphs for dihedral, semi-dihedral, cyclic and dicyclic groups were computed.

APA, Harvard, Vancouver, ISO, and other styles

46

Jr., Isagani S. Cabahug,, Rolito G. Eballe, and Cherry Mae R. Balingit. "Restrained dr-Power Dominating Sets in Graphs." Journal of Advances in Mathematics and Computer Science 38, no. 9 (2023): 45–50. http://dx.doi.org/10.9734/jamcs/2023/v38i91803.

Full text

Abstract:

Consider a nontrivial connected graph G. In this context, a set R that is not empty and a subset of V (G) is referred to as a restrained dr-power dominating set of G. This means that the induced subgraph of the complement of R in G does not contain any isolated vertex and qualifies as a dr-power dominating set of G. To determine the restrained dr-power domination number of G, denoted as yrpw (G), we look at the minimum cardinality of a restrained dr-power dominating set. This study presents significant insights into the restrained dr-power dominating set of a graph G. It provides concrete real

APA, Harvard, Vancouver, ISO, and other styles

47

Sander, J. W., and T. Sander. "The energy of integral circulant graphs with prime power order." Applicable Analysis and Discrete Mathematics 5, no. 1 (2011): 22–36. http://dx.doi.org/10.2298/aadm110131003s.

Full text

Abstract:

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

APA, Harvard, Vancouver, ISO, and other styles

48

Guo, Jin, Tongsuo Wu, and Meng Ye. "Complemented graphs and blow-ups of Boolean graphs, with applications to co-maximal ideal graphs." Filomat 29, no. 4 (2015): 897–908. http://dx.doi.org/10.2298/fil1504897g.

Full text

Abstract:

For a set X, let 2X be the power set of X. Let BX be the Boolean graph, which is defined on the vertex set 2X \ {X, ?}, with M adjacent to N if M ? N = ?. In this paper, several purely graph-theoretic characterizations are provided for blow-ups of a finite or an infinite Boolean graph (respectively, a preatomic graph). Then the characterizations are used to study co-maximal ideal graphs that are blow-ups of Boolean graphs (pre-atomic graphs, respectively).

APA, Harvard, Vancouver, ISO, and other styles

49

Parks, Allen D., and David J. Marchette. "Persistent homology in graph power filtrations." Royal Society Open Science 3, no. 10 (2016): 160228. http://dx.doi.org/10.1098/rsos.160228.

Full text

Abstract:

The persistence of homological features in simplicial complex representations of big datasets in R n resulting from Vietoris–Rips or Čech filtrations is commonly used to probe the topological structure of such datasets. In this paper, the notion of homological persistence in simplicial complexes obtained from power filtrations of graphs is introduced. Specifically, the r th complex, r ≥ 1, in such a power filtration is the clique complex of the r th power G r of a simple graph G . Because the graph distance in G is the relevant proximity parameter, unlike a Euclidean filtration of a dataset wh

APA, Harvard, Vancouver, ISO, and other styles

50

Natarajan, Meghanathan. "EXPLOITING THE DISCRIMINATING POWER OF THE EIGENVECTOR CENTRALITY MEASURE TO DETECT GRAPH ISOMORPHISM." International Journal on Foundations of Computer Science & Technology (IJFCST) 5, no. 6 (2023): 13. https://doi.org/10.5281/zenodo.7866931.

Full text

Abstract:

Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-complete. Several heuristic algorithms have been proposed to determine whether or not two graphs are isomorphic (i.e., structurally the same). In this paper, we analyze the discriminating power of the well-known centrality measures on real-world network graphs and propose to use the sequence (either the non-decreasing or non-increasing order) of eigenvector centrality (EVC) values of the vertices of two graphs as a prec

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!