相关论文: Corona product of signed graphs and its applicatio…
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two…
This paper introduces the concept of $\mu$-signed and duplication signed graphs and shows that both are always structurally balanced. Using the duplication signed graph, we define the corona product of the duplication signed graph…
For unsigned graphs G and H, the characteristic polynomial of different graph matrices for edge corona, subdivision vertex neighbourhood corona and subdivision edge neighbourhood corona has already been studied using the concept of coronal.…
In this paper, we extend our earlier proposal of corona product of signed graphs into generalized corona product of signed graphs inspired by the generalized corona product of unsigned graphs. Then we study structural balance and spectral…
Two types of corona products for simple directed graphs are introduced, extending the classical notions from the undirected setting: the vertex-corona and the arc-corona. Their structural and spectral properties are investigated through the…
Various graph products and operations have been widely used to construct complex networks with common properties of real-life systems. However, current works mainly focus on designing models of binary networks, in spite of the fact that…
The paper focuses on studying strong geodetic sets and numbers in the context of corona-type products of graphs. Our primary focus is on three variations of the corona products: the generalized corona, generalized edge corona, and…
In this paper, we investigate the spectral properties of the closed neighborhood corona product of graphs, which was introduced by Harishchandra S. Ramane et al.~\cite{ramane2021polynomials} (cf. Polynomials Associated with Closed…
Many graph products have been applied to generate complex networks with striking properties observed in real-world systems. In this paper, we propose a simple generative model for simplicial networks by iteratively using edge corona…
The corona of hypergraphs is an extension of the corona operation applied to graphs. The corona $G_0^* \odot_1^n G_1^*$ of two hypergraphs is obtained by taking $n$ copies of $G_1^*$ (where $n$ is the order of $G_0^*$) and by joining the…
Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…
In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph $(G, \sigma)$ can be colored using exactly $\Delta(G)$ or $\Delta(G) + 1$ colors, where $\Delta(G)$ is the maximum degree in graph $G$.…
For a vertex $x$ of a graph $G$, let $N_G[x]$ be the set of $x$ with all of its neighbors in $G$. A set $C$ of vertices is an {\em identifying code} of $G$ if the sets $N_G[x]\cap C$ are nonempty and distinct for all vertices $x$. If $G$…
In this paper, we look into Signed Product Cordial Labeling for Splitting Graphs of Bull graph and Splitting graph of Star graph , Square of Path graph, Coronaand also for the graph obtained by joining two copies of Helm by a Path of…
Recently, real world networks having constant/shrinking diameter along with power-law degree distribution are observed and investigated in literature. Taking an inspiration from these findings, we propose a deterministic complex network…
In this paper, we study rooted products of graphs from the perspective of combinatorial commutative algebra. For edge ideals, we introduce the 2-Cohen-Macaulayness with respect to a vertex and use it to investigate when edge ideals of…
We introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of the corona $G\circ H$ of two graphs $G$ and $H$. In particular, we show that this spectrum is completely determined by the spectra of $G$ and $H$…
A set of vertices $S$ of a graph $G$ is a geodetic set of $G$ if every vertex $v\not\in S$ lies on a shortest path between two vertices of $S$. The minimum cardinality of a geodetic set of $G$ is the geodetic number of $G$ and it is denoted…
For a simple graph $G$, let $J_G$ denote the corresponding binomial edge ideal. This article considers the binomial edge ideal of the corona product of two connected graphs $G$ and $H$. The corona product of $G$ and $H$, denoted by $G\circ…
Let $G$ be a simple graph with $m$ edges and $H_i$, $1\leq i \leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \diamond (H_1, ..., H_m)$, is obtained by taking one copy of…