Results 41 to 50 of about 1,307,438 (325)
A Study on the Nourishing Number of Graphs and Graph Powers [PDF]
Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\mathbb{N}_{0})\) such that the induced edge-function \(f^+:E(G) \to\mathcal{P}(\mathbb{N}_{0})\) defined by \
Naduvath, Sudev, Augustine, Germina
openaire +5 more sources
Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Asma Hamzeh
doaj +1 more source
Power Domination in Graphs [PDF]
In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process.
openaire +4 more sources
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
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
Clawfreeness of the powers of a graph
AbstractLet n∈N. We describe a list Gn of graphs such that if the nth power Gn of a graph G contains a claw then some graph in Gn appears as an induced subgraph of G. We show that our set Gn is the smallest set of graphs with this property. If T is a tree, this gives a precise characterization of the claw-free powers of T.
Patrick Bahls, Nicole Gin
openaire +2 more sources
Distributed Approximation on Power Graphs [PDF]
We investigate graph problems in the following setting: we are given a graph $G$ and we are required to solve a problem on $G^2$. While we focus mostly on exploring this theme in the distributed CONGEST model, we show new results and surprising connections to the centralized model of computation.
Bar-Yehuda, Reuven +4 more
openaire +3 more sources
The topological (graph) structure of complex networks often provides valuable information about the performance and vulnerability of the network. However, there are multiple ways to represent a given network as a graph.
Barrows, Clayton +3 more
core +1 more source
Signless Laplacian spectrum of power graphs of finite cyclic groups
In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj +1 more source
On groups with specified quotient power graphs [PDF]
. In this paper we study some relations between the power andquotient power graph of a finite group. These interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a ...
Mostafa Shaker, Mohammadali Iranmanesh
doaj
Operation control of power systems has become challenging with an increase in the scale and complexity of power distribution systems and extensive access to renewable energy.
Kai Xiao +4 more
doaj +1 more source

