Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On Laplacian Commutativity of Graphs
View through CrossRef
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs. Two graphs are Laplacian commutative if their Laplacian matrices commute. The commutativity of the Laplacian matrix of a graph G
with its complement, G′
, and its k−
complement, GkP
is also examined. Laplacian commutativity depends on the partition P
of vertex set of G
, VG
and GkP
. Some necessary and sufficient conditions on the partition P
are described for the Laplacian commutativity of cycle Cn
with (Cn)Pk
.
Universiti Putra Malaysia
Title: On Laplacian Commutativity of Graphs
Description:
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs.
Two graphs are Laplacian commutative if their Laplacian matrices commute.
The commutativity of the Laplacian matrix of a graph G
with its complement, G′
, and its k−
complement, GkP
is also examined.
Laplacian commutativity depends on the partition P
of vertex set of G
, VG
and GkP
.
Some necessary and sufficient conditions on the partition P
are described for the Laplacian commutativity of cycle Cn
with (Cn)Pk
.
Related Results
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formul...
Quasi- Laplacian energy of some novel classes of graphs
Quasi- Laplacian energy of some novel classes of graphs
We formulate the relationship of quasi-Laplacian energy of some novel classes of graphs with their corresponding original graphs. The novel graphs in our discussion are the -graph,...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
DISCRETIZATION OF LAPLACIAN OPERATOR IN POLAR COORDINATE SYSTEM, USING CRANK-NICOLSON’S (CN) SCHEME AND STABILITY ANALYSIS
DISCRETIZATION OF LAPLACIAN OPERATOR IN POLAR COORDINATE SYSTEM, USING CRANK-NICOLSON’S (CN) SCHEME AND STABILITY ANALYSIS
Laplacian operator plays a vital role for describing and solving many mathematical models. Finite difference Scheme of Laplacian operator has been carried out by various researcher...