Net Laplacian spectrum of some products built on the simple corona of a signed graph

For a signed graph [Formula: see text], if [Formula: see text] and [Formula: see text] are its adjacency matrix and diagonal matrix of net degrees, then the net Laplacian matrix of [Formula: see text] is [Formula: see text]. A simple corona [Formula: see text] is obtained by attaching a positive pendant edge at every vertex of [Formula: see text]. In this paper, we define the three products of signed graphs [Formula: see text] and [Formula: see text] based on the simple corona [Formula: see text], and compute their net Laplacian spectrum when [Formula: see text] is net-regular. As an application, we consider the controllability of the corresponding products.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-12-27
DOI
https://doi.org/10.1142/s1793830925500193
Citations
1
Primary Topic
Advanced Research in Systems and Signal Processing
Type
article
Field-Weighted Citation Impact
0.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Net Laplacian spectrum of some products built on the simple corona of a signed graph

Zoran Stanić, S. Pirzada, Mir Riyaz ul Rashid
1 citations
Discrete Mathematics Algorithms and Applications
Advanced Research in Systems and Signal Processing
0.33
article

Net Laplacian spectrum of some products built on the simple corona of a signed graph

Zoran Stanić, S. Pirzada, Mir Riyaz ul Rashid
article en
1 citations

Abstract

For a signed graph [Formula: see text], if [Formula: see text] and [Formula: see text] are its adjacency matrix and diagonal matrix of net degrees, then the net Laplacian matrix of [Formula: see text] is [Formula: see text]. A simple corona [Formula: see text] is obtained by attaching a positive pendant edge at every vertex of [Formula: see text]. In this paper, we define the three products of signed graphs [Formula: see text] and [Formula: see text] based on the simple corona [Formula: see text], and compute their net Laplacian spectrum when [Formula: see text] is net-regular. As an application, we consider the controllability of the corresponding products.

Discrete Mathematics Algorithms and ApplicationsVol. 18(01)
University of Kashmir (IN), University of Belgrade (RS)
Openalex Percentile: Top 38%
Advanced Research in Systems and Signal Processing
0.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.