Generalized Corona Product

• The generalized corona product is a graph construction that attaches different graphs to each vertex or edge of a base graph, thereby modifying key invariants such as order, diameter, and spectrum.
• This construction enables precise evaluation of structural parameters like chromatic numbers, domination, independence, and geodetic properties while preserving a clear block structure.
• Extensions to signed graphs and iterative models offer deep insights into spectral factorizations, structural balance, and cospectrality, broadening its applications in network analysis.

Searching arXiv for recent and foundational papers on generalized corona products and related corona-type graph products. The generalized corona product is a family of graph constructions that extends the classical corona by allowing nonuniform attachments to a base graph. In the unsigned setting, one standard form takes a graph $G$ and a collection of graphs $H_i$, attaching one $H_i$ to each vertex of $G$; an edge-based analogue attaches one $H_i$ to each edge of $G$. These constructions preserve a transparent block structure while substantially modifying graph invariants such as order, size, diameter, chromatic parameters, domination, independence, geodeticity, and spectra. The notion has also been extended to signed graphs, where the attachment edges inherit signs from vertex markings, enabling structural-balance and cospectrality analyses by means of signed coronals (Sonar et al., 2024, Abdolhosseinzadeh et al., 2017, Singh et al., 2023).

1. Core definitions and variants

For a simple connected graph $G=(V(G),E(G))$ with $V(G)=\{u_1,u_2,\dots,u_n\}$, and simple graphs $H_i$ of orders $t_i=|V(H_i)|$, the generalized corona is denoted

$H_i$0

It is obtained by taking one copy of $H_i$1, one copy of each $H_i$2, and then adding, for each $H_i$3, all edges joining $H_i$4 to every vertex of $H_i$5. Equivalently,

$H_i$6

and

$H_i$7

When all $H_i$8, this reduces to the ordinary corona product $H_i$9 (Sonar et al., 2024).

An edge-based generalization appears in the generalized edge corona product. If $H_i$0 is a simple graph with edge set $H_i$1, where $H_i$2, and $H_i$3 are simple graphs, then

$H_i$4

has vertex set

$H_i$5

and edge set

$H_i$6

In words, for each edge $H_i$7 of $H_i$8, the graph $H_i$9 is attached by joining each of its vertices to both $G$0 and $G$1 (Abdolhosseinzadeh et al., 2017).

A related uniform edge-corona construction uses a single graph $G$2, attaching a fresh copy $G$3 to each edge $G$4. In that notation,

$G$5

and

$G$6

This is described as a natural “dual” of the classical vertex corona, because it attaches a copy of $G$7 to each edge of $G$8 rather than to each vertex (Wang et al., 2020).

The literature therefore uses “generalized corona product” in more than one sense. In one line of work it denotes nonuniform vertex-attached coronae; in another, nonuniform edge-attached coronae. A plausible implication is that careful attention to notation is necessary, since the same adjective “generalized” refers to different attachment schemes in different papers.

2. Constructional viewpoint and immediate structural parameters

The generalized corona admits a direct constructive description: start with one copy of $G$9, place one copy of each attachment graph, and connect the designated base vertex $H_i$0 to every vertex of the corresponding fiber $H_i$1 (Sonar et al., 2024). The generalized edge corona proceeds analogously, but the attachment site is an edge $H_i$2, and every vertex of $H_i$3 is joined to both endpoints (Abdolhosseinzadeh et al., 2017).

For the generalized corona $H_i$4, the basic counts are explicit. Its order is

$H_i$5

and its size is

$H_i$6

If both $H_i$7 and each $H_i$8 are connected, then the product is connected. Its diameter satisfies

$H_i$9

For the ordinary corona $G$0, antipodal pairs in the fibers correspond to antipodes in the base graph: two vertices $G$1 and $G$2 are antipodal in $G$3 if and only if $G$4 and $G$5 are antipodal in $G$6 (Sonar et al., 2024).

A simple example of the edge-attached construction is obtained by taking $G$7, the single edge $G$8, and $G$9. Then the resulting graph has vertices $G=(V(G),E(G))$0, with edges $G=(V(G),E(G))$1, $G=(V(G),E(G))$2, and the four attachment edges $G=(V(G),E(G))$3. The result is the familiar diamond graph on four vertices (Abdolhosseinzadeh et al., 2017).

These formulas show that generalized corona products alter metric structure in a tightly controlled way: attachment contributes one extra step at each end of a base-to-base geodesic in the vertex-attached case, while in the edge-attached case the local neighborhoods of edge endpoints expand by the orders of the attached graphs. This suggests why distance-based colorings and geodetic parameters are especially natural invariants for these products.

3. Distance coloring and related chromatic parameters

For the generalized edge corona, the paper “On Generalized Edge Corona Product of Graphs” derives exact and sharp formulas for several $G=(V(G),E(G))$4-distance chromatic numbers. If $G=(V(G),E(G))$5 denotes the minimum number of colors so that any two vertices at graph-distance $G=(V(G),E(G))$6 receive different colors, then the ordinary chromatic number satisfies

$G=(V(G),E(G))$7

The lower bound comes from the induced copy of $G=(V(G),E(G))$8 and from the need to color each $G=(V(G),E(G))$9 with colors distinct from the two endpoint colors of the supporting edge $V(G)=\{u_1,u_2,\dots,u_n\}$0. The upper bound is achieved by first properly coloring $V(G)=\{u_1,u_2,\dots,u_n\}$1 and then coloring each $V(G)=\{u_1,u_2,\dots,u_n\}$2 with the remaining $V(G)=\{u_1,u_2,\dots,u_n\}$3 colors when $V(G)=\{u_1,u_2,\dots,u_n\}$4 (Abdolhosseinzadeh et al., 2017).

For trees, the 2-distance chromatic number is determined by the maximum degree and the orders of the attachment graphs. If $V(G)=\{u_1,u_2,\dots,u_n\}$5 is a tree of maximum degree $V(G)=\{u_1,u_2,\dots,u_n\}$6, and $V(G)=\{u_1,u_2,\dots,u_n\}$7 are the edges incident to a fixed vertex $V(G)=\{u_1,u_2,\dots,u_n\}$8, with $V(G)=\{u_1,u_2,\dots,u_n\}$9, then

$H_i$0

In the uniform case $H_i$1 with $H_i$2,

$H_i$3

For complete graphs $H_i$4, writing $H_i$5 and $H_i$6 for the matching number, the paper gives

$H_i$7

In the uniform case $H_i$8 with $H_i$9,

$t_i=|V(H_i)|$0

For complete bipartite graphs, the 3-distance chromatic number is exact: $t_i=|V(H_i)|$1 and in the uniform case $t_i=|V(H_i)|$2 of order $t_i=|V(H_i)|$3,

$t_i=|V(H_i)|$4

The proof strategy combines the increase in maximum degree under the edge-corona operation, the inequality $t_i=|V(H_i)|$5, and partitioning-of-edge-sets arguments for complete graphs (Abdolhosseinzadeh et al., 2017).

These results clarify a frequent misconception: generalized corona-type products do not merely shift the chromatic number by a fixed additive constant. In the edge-corona case, ordinary coloring depends on $t_i=|V(H_i)|$6, but distance coloring can scale with the maximum degree of the base graph and the total orders of multiple attachments around a high-degree vertex.

4. Domination, independence, and strong geodeticity

In the generalized edge corona, domination and independence admit exact evaluations when the base graph is connected. A set $t_i=|V(H_i)|$7 is dominating if every $t_i=|V(H_i)|$8 has a neighbor in $t_i=|V(H_i)|$9, and the domination number $H_i$00 is the size of a smallest dominating set. If $H_i$01 is connected, then

$H_i$02

where $H_i$03 is the vertex-cover number of $H_i$04. The proof uses the observation that any dominating set in the corona must dominate each attached edge-plus-fiber subgraph, and that placing dominating vertices inside the $H_i$05 pieces is never advantageous compared with moving them to endpoints in $H_i$06 (Abdolhosseinzadeh et al., 2017).

For the same product, the independence number satisfies

$H_i$07

again for connected $H_i$08. This formula isolates the independent behavior entirely in the fiber graphs, rather than in the base graph (Abdolhosseinzadeh et al., 2017).

A different parameter family arises in recent work on strong geodeticity for corona-type products. For the generalized corona $H_i$09, let $H_i$10 denote the strong 2-geodetic number of $H_i$11, and $H_i$12 a corresponding basis. Then

$H_i$13

In the ordinary corona case, if each $H_i$14 and $H_i$15, then

$H_i$16

Special cases include

$H_i$17

when $H_i$18 is edgeless on $H_i$19 vertices, and

$H_i$20

when $H_i$21 is complete (Sonar et al., 2024).

Very similar formulas hold for the generalized edge-corona and neighborhood-corona, in each case expressing the strong geodetic number of the product as the sum of the strong 2-geodetic numbers of the attached graphs (Sonar et al., 2024). This suggests a unifying principle across corona-type products: geodetic coverage is controlled by the fibers rather than by the base, once the attachment mechanism forces all long geodesics to pass through the base interface.

5. Spectral theory and coronal methods

A substantial branch of the theory concerns spectral factorization. For generalized corona products of signed graphs, the construction begins with a signed graph

$H_i$22

and signed graphs

$H_i$23

The generalized corona product

$H_i$24

is formed by attaching every vertex of $H_i$25 to the $H_i$26th vertex of $H_i$27, with the sign of a new edge $H_i$28 declared to be

$H_i$29

Under a natural ordering of the vertices, the adjacency matrix has block form

$H_i$30

where the coupling block $H_i$31 is built from the marking vectors (Singh et al., 2023).

The key tool is the signed coronal

$H_i$32

together with Laplacian and signless-Laplacian analogues

$H_i$33

Using Schur complements, the adjacency-characteristic polynomial factors as

$H_i$34

where

$H_i$35

If all $H_i$36, then

$H_i$37

Parallel factorizations hold for Laplacian and signless-Laplacian polynomials (Singh et al., 2023).

For ordinary iterated corona graphs generated from a seed graph $H_i$38, the adjacency matrix of the $H_i$39th iterate $H_i$40 has an explicit block structure, and the adjacency, Laplacian, and signless Laplacian spectra can be built in closed form from the spectra of the previous iterate and of the seed when the seed is regular (Sharma et al., 2015). In particular, if $H_i$41 is $H_i$42-regular, the adjacency spectrum of $H_i$43 consists of two branches $H_i$44 defined recursively from the eigenvalues $H_i$45 of $H_i$46, together with the old eigenvalues $H_i$47 for $H_i$48, each with multiplicity $H_i$49. Corresponding branch formulas are also given for Laplacian and signless-Laplacian eigenvalues (Sharma et al., 2015).

The edge-corona network model on complete graphs goes further by giving explicit spectra for the normalized Laplacian of the iterated family

$H_i$50

with recursive spectral relation

$H_i$51

and corresponding normalized-Laplacian formula

$H_i$52

This explicit solvability supports exact formulas for mixing time, mean hitting time, and the number of spanning trees (Wang et al., 2020).

6. Iterative models, network structure, and signed extensions

Iterated corona constructions have been used as deterministic network models. For a fixed seed graph $H_i$53, the iterated corona graphs are defined by

$H_i$54

When $H_i$55 is regular, the cumulative degree distribution of $H_i$56 is

$H_i$57

which decays exponentially in $H_i$58. When the seed is a clique $H_i$59, the cumulative betweenness distribution satisfies

$H_i$60

that is, a power law with exponent near $H_i$61 (Sharma et al., 2015).

For the edge-corona simplicial-network model based on repeated attachment of $H_i$62 to the edges of $H_i$63, the numbers of edges and vertices are

$H_i$64

A vertex created at iteration $H_i$65 has degree

$H_i$66

and the resulting network is scale-free with exponent

$H_i$67

Its diameter satisfies

$H_i$68

and its clustering obeys

$H_i$69

The model also yields closed-form clique counts: $H_i$70 with $H_i$71 and $H_i$72 (Wang et al., 2020).

Signed generalizations introduce a different layer of structure. In the corona product of signed graphs, the spoke-edge signs are determined by vertex markings $H_i$73, and one obtains closed-form counts of positive and negative edges, triads of types $H_i$74, and spectral formulas for adjacency and signed Laplacian matrices (1908.10018). Iterating the signed corona

$H_i$75

produces a deterministic growing signed-network model with

$H_i$76

The algebraic conflict is tracked via iterates of a quadratic spectral map, and in a specific uniform-$H_i$77 regime the minimum Laplacian eigenvalue can remain equal to that of the seed for all iterations (1908.10018).

7. Structural balance, cospectrality, and scope of the concept

For generalized corona products of signed graphs, structural balance is not determined solely by the balance of the constituents. One result states that if any constituent $H_i$78 or $H_i$79 is unbalanced then so is the product. Conversely, even when all $H_i$80 are balanced, the added coronal edges can create unbalanced 3-triads if there is an edge in some $H_i$81 of one of three types: a positive edge joining two opposite-marked vertices, a negative edge joining two negatively marked vertices, or a negative edge joining two positively marked vertices (Singh et al., 2023).

The same coronal machinery yields cospectrality criteria. If $H_i$82 is fixed and two collections $H_i$83 and $H_i$84 satisfy

$H_i$85

then the corresponding generalized corona products are adjacency-cospectral. Analogous statements hold for Laplacian and signless-Laplacian cospectrality when the corresponding signed coronals agree. If the attachments are all identical, then cospectral base graphs produce cospectral corona products as well (Singh et al., 2023).

A broader perspective emerges from later work on digraphs, where two corona-type constructions are introduced: the vertex-corona and the arc-corona. The arc-corona includes a symmetric variant that attaches copies along undirected edges of the underlying graph, with adjacency blocks written using incidence matrices. This suggests that the passage from vertex-based to edge-based attachment is not confined to undirected graphs but fits into a wider coronal framework spanning adjacency, Laplacian, and signless-Laplacian spectra (Cavers et al., 17 Sep 2025).

Taken together, these results show that “generalised corona product” is best understood as a family of attachment operators rather than a single graph product. The shared feature is a one-copy base graph together with multiple attached fibers, possibly heterogeneous, attached either at vertices or at edges. What varies across the literature is the attachment site, the role of markings or signs, and the target invariant: distance coloring in generalized edge coronae (Abdolhosseinzadeh et al., 2017), strong geodeticity in corona-type products (Sonar et al., 2024), recursive and closed-form spectral theory for iterated corona graphs (Sharma et al., 2015), analytically solvable edge-corona network models (Wang et al., 2020), and structural balance and cospectrality in signed generalizations (Singh et al., 2023, 1908.10018).