Results 31 to 40 of about 543 (81)

Parabolic theory of the discrete p-Laplace operator [PDF]

, 2013
We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem.
Mugnolo, Delio
core   +1 more source

Applications on color (distance) signless laplacian energy of annihilator monic prime graph of commutative rings

Ain Shams Engineering Journal
In this study, we define the structure formation of the annihilator monic prime graph of commutative rings, whose distinct vertices X and J satisfies a condition annXJ≠annX⋃ann(J), graph is denoted by AMPG(Zn[x]/〈fx〉).
R. Sarathy, J. Ravi Sankar
doaj   +1 more source

Investigating Signless Laplacian Spectra and Network Topology in Helical Phenylene‐Quadrilateral Structures

Journal of Mathematics, Volume 2025, Issue 1, 2025.
This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif, Ali Raza, Md. Shajib Ali, Pramita Mishra   +3 more
wiley   +1 more source

Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy

Mathematics
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new
Luis Medina, Jonnathan Rodríguez, Macarena Trigo   +2 more
doaj   +1 more source

Distance Spectra of Some Double Join Operations of Graphs

International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.
In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha, B. R. Rakshith, K. N. Prakasha, N. V. Sayinath Udupa, Abdul Rauf Khan   +4 more
wiley   +1 more source

Laplacian spectral characterization of roses

, 2017
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu and Q.X. Huang,
Belardo, Brouwer, Changxiang He, Cvetković, Cvetković, Edwin R. van Dam, Liu, Liu, Ma, Sachs, van Dam, van Dam, van Dam, Wang, Wang, Wang   +15 more
core   +2 more sources

The domination number and the least $Q$-eigenvalue [PDF]

, 2013
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang, Wu, Yarong, Yu, Guanglong, Zhang, Rong   +3 more
core  

Merging the A- and Q-spectral theories

, 2016
Let $G$ be a graph with adjacency matrix $A\left( G\right) $, and let $D\left( G\right) $ be the diagonal matrix of the degrees of $G.$ The signless Laplacian $Q\left( G\right) $ of $G$ is defined as $Q\left( G\right) :=A\left( G\right) +D\left( G\right)
Nikiforov, V.
core   +1 more source

Laplacian Distribution and Domination [PDF]

, 2016
Let $m_G(I)$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$, and let $\gamma(G)$ denote its domination number. We extend the recent result $m_G[0,1) \leq \gamma(G)$, and show that isolate-free graphs also satisfy $\gamma(G) \
Cardoso, Domingos M., Jacobs, David P., Trevisan, Vilmar   +2 more
core   +2 more sources

Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]

Discrete Mathematics Letters, 2022
Saleem Khan, Shariefuddin Pirzada
doaj   +1 more source