Results 11 to 20 of about 2,382 (198)
Formulas for the Number of Weak Homomorphisms from Paths to Ladder Graphs and Stacked Prism Graphs
Journal of Mathematics, 2023 Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. A ladder graph is the Cartesian product of two paths, where one of the paths has only one edge.
Hatairat Yingtaweesittikul +2 more
doaj +1 more source
On Path-Pairability in the Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2016 We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product.
Mészáros Gábor
doaj +1 more source
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
Ural Mathematical Journal, 2023 A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +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
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 development of cartesian product operation of product fuzzy graphs and its properties
DesimalThe product fuzzy graph is an extension of the fuzzy graph definition by replacing the minimum operation with the product operation. This research is qualitative research with research stages consisting of determining open problems, constructing new ...
Fery Firmansah +2 more
doaj +1 more source
The Crossing Numbers of Products of Path with Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj +1 more source
Distance antimagic labelings of Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho +2 more
doaj +1 more source
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