Results 51 to 60 of about 256,711 (164)

Power domination in Kn\"odel graphs and Hanoi graphs

Discussiones Mathematicae Graph Theory, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varghese, Seethu, Vijayakumar, A., Hinz, Andreas M.   +2 more
openaire   +3 more sources

SHACL-Based Validation Method of Knowledge Graph for Power System Model

Zhongguo dianli, 2022
With the expansion of the power grid and the high penetration of distributed energy resources, the power system analysis and decision-making have put forward higher requirements for comprehensive and accurate power grid models.
Xiaolu LI, Xuan ZUO, Riliang LIU, Yiming LU, Congli LI, Shunfu LIN   +5 more
doaj   +1 more source

Regularity of bicyclic graphs and their powers [PDF]

Journal of Algebra and Its Applications, 2019
Let [Formula: see text] be the edge ideal of a bicyclic graph [Formula: see text] with a dumbbell as the base graph. In this paper, we characterize the Castelnuovo–Mumford regularity of [Formula: see text] in terms of the induced matching number of [Formula: see text]. For the base case of this family of graphs, i.e.
Cid-Ruiz, Yairon, Jafari, Sepehr, Nemati, Navid, Picone, Beatrice   +3 more
openaire   +4 more sources

What can graphs and algebraic structures say to each other?

AKCE International Journal of Graphs and Combinatorics
In the last couple of decades, there has been a big upsurge of research on graphs defined on algebraic structures (groups, rings, vector spaces, semigroups, and others).
Peter J. Cameron
doaj   +1 more source

ZERO FORCING NUMBER AND MAXIMUM NULLITY OF GENERAL POWER GRAPHS [PDF]

Journal of Algebraic Systems
Let Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ.
Fateme Kheiridosst, Ebrahim Vatandoost
doaj   +1 more source

On the Extended Adjacency Eigenvalues of Graphs and Applications

Mathematics
Let Aex(G) be the extended adjacency matrix of G. The eigenvalues of Aex(G) are called extended adjacency eigenvalues of G. The sum of the absolute values of eigenvalues of the Aex-matrix is called the extended adjacency energy Eex(G) of G. In this paper,
Hilal A. Ganie, Amal Alsaluli
doaj   +1 more source

SOME GRAPH PARAMETERS OF POWER SET GRAPHS

Advances and Applications in Discrete Mathematics, 2021
In this study, we examine some graph parameters such as the edge number, chromatic number, girth, domination number and clique number of power set graphs.
Cangül, İsmail Naci, Pak, Sedat, Akgüneş, Nihat, Nacaroğlu, Yaşar   +3 more
openaire   +2 more sources

Some Characterizations and NP-Complete Problems for Power Cordial Graphs

Journal of Mathematics, 2023
A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj   +1 more source

On the difference graph of power graphs of finite groups

Quaestiones Mathematicae, 2023
2 ...
Kumar, Jitender, Panda, Ramesh Prasad, Parveen   +2 more
openaire   +3 more sources

Between the enhanced power graph and the commuting graph

Journal of Graph Theory, 2022
AbstractThe purpose of this note is to define a graph whose vertex set is a finite group , whose edge set is contained in that of the commuting graph of and contains the enhanced power graph of . We call this graph the deep commuting graph of . Two elements of are joined in the deep commuting graph if and only if their inverse images in every central ...
Peter J. Cameron, Bojan Kuzma
openaire   +5 more sources