This paper proposes an MPC - based (model predictive control) scheme to control active and reactive powers of DERs (distributed energy resources) in a grid - connected mode (either through a bus with its associated loads as a PCC (point of common coupling) or an MG (micro - grid)). DER may be a DG (distributed generation) or an ESS (energy storage system). In the proposed scheme, the set - poin...

abstract let ‎g=(v,e) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎v‎‎‎ ‎and ‎edge ‎set ‎‎‎e. ‎the szeged index ‎of ‎‎g is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎g ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎if ‎‎‎‎s ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎v ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎s ‎of ‎size ‎3. ‎then ‎we ‎define ‎three ‎...

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

Recently, Brushless Cascaded Doubly Fed Induction Generator (BCDFIG) has been considered as an attractive choice for grid-connected applications due to its high controllability and reliability. In this paper, a Finite Control Set Model Predictive Control (FCS-MPC) method with active and reactive power control capability in grid-connected mode is proposed for controlling the BCDFIG in a way that...

Given a graphG, the k-dominating graph ofG, Dk(G), is defined to be the graph whose vertices correspond to the dominating sets of G that have cardinality at most k. Two vertices in Dk(G) are adjacent if and only if the corresponding dominating sets of G differ by either adding or deleting a single vertex. The graph Dk(G) aids in studying the reconfiguration problem for dominating sets. In parti...

A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...

Let k¿2; n=2+1; and let m0; : : : ; mk−1 each be a multiple of n. The graph Cm0×· · ·×Cmk−1 consists of isomorphic connected components, each of which is (n − 1)-regular and admits of a vertex partition into n smallest independent dominating sets. Accordingly, (independent) domination number of each connected component of this graph is equal to (1=n)th of the number of vertices in it. ? 2001 El...

Let G be a finite group and let k be a field of characteristic p. Given a finitely generated indecomposable non-projective kG-module M , we conjecture that if the Tate cohomology Ĥ ∗ (G, M) of G with coefficients in M is finitely generated over the Tate cohomology ring Ĥ ∗ (G, k), then the support variety VG(M) of M is equal to the entire maximal ideal spectrum VG(k). We prove various results w...