Results 41 to 50 of about 3,558 (256)
On the Skew Spectra of Cartesian Products of Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 An oriented graph ${G^{\sigma}}$ is a simple undirected graph $G$ with an orientation, which assigns to each edge of $G$ a direction so that ${G^{\sigma}}$ becomes a directed graph. $G$ is called the underlying graph of ${G^{\sigma}}$ and we denote by $S({G^{\sigma}})$ the skew-adjacency matrix of ${G^{\sigma}}$ and its spectrum $Sp({G^{\sigma}})$ is ...
Denglan Cui, Yaoping Hou
openaire +2 more sources
THE CARTESIAN PRODUCT OF GRAPHS [PDF]
, 2021 Diplomsko delo je sestavljeno iz treh poglavij. V prvem poglavju predstavimo osnovne pojme teorije grafov in podamo definicije ter osnovne lastnosti kartezičnega produkta dveh ali večih grafov.
Merkač, Iris
core +1 more source
Prime Factorization And Domination In The Hierarchical Product Of Graphs
Discussiones Mathematicae Graph Theory, 2017 In 2009, Barrière, Dalfó, Fiol, and Mitjana introduced the generalized hierarchical product of graphs. This operation is a generalization of the Cartesian product of graphs.
Anderson S.E. +3 more
doaj +1 more source
On the connectivity of Cartesian product of graphs
Ars Mathematica Contemporanea, 2013 We give a new alternative proof of Liouville’s formula which states that for any graphs G and H on at least two vertices, κ ( G □ H ) = min{ κ ( G )| H |, | G | κ ( H ), δ ( G ) + δ ( H )} , where κ and δ denote the connectivity number and minimum degree of a given graph, respectively.
Jelena Govorcin, Riste Skrekovski
openaire +2 more sources
Convex domination in the composition and Cartesian product of graphs [PDF]
, 2012 summary:In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a graph are defined.
Labendia, Mhelmar A. +1 more
core +1 more source
The adjacency spectrum of two new operations of graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and ...
Dijian Wang, Yaoping Hou, Zikai Tang
doaj +1 more source
The profile of the Cartesian product of graphs
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Kuo, Jing-Ho Yan
openaire +2 more sources
On 1RJ Moves in Cartesian Product Graphs [PDF]
, 2019 The results of this paper, which is an extension of the work [Motion planning in Cartesian product graphs, Discussiones Mathematicae Graph Theory 34 (2014) 207-221] gives the minimum number of moves required for the motion planning problem in Cartesian ...
Oyewumi, O., Akwu, A. D.
core +1 more source
Fork-Decomposition of Cartesian Product of Graphs [PDF]
, 2023 Let G = (V, E) be a graph. Fork is a tree obtained by subdividing any edge of a star of size three exactly once. In this paper, we investigate the necessary and sufficient condition for the fork-decomposition of Cartesian product of ...
Issacraj, Samuel, Joseph, J. Paulraj
core +2 more sources
International Journal of Robust and Nonlinear Control, EarlyView., 2023 Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source