Partial Chain Graphs

Shahistha, . and Bhat, Arathi K and Sudhakara, G (2022) Partial Chain Graphs. Engineering Letters, 30 (1). ISSN 1816-093X

[img] PDF
14877.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Chain graphs and threshold graphs are often referred to as extremal graphs, in the context that, they have the largest spectral radius among all the bipartite graphs (former one) and all the connected graphs (latter one). Nesting in the neighborhood of vertices in the above said extremal graphs have gained the attention of various researchers. Motivated by this structure, we generalize and define a new class of graphs named ’partial chain graphs’ and study the properties. We also give the expression for rank, determinant and permanent of these graphs, from which permanent and determinants of well-known wheel graphs, fan graphs, and friendship graphs can be derived

Item Type: Article
Uncontrolled Keywords: —Rank, Determinant, Permanent, Wheel graph, Fan graph
Subjects: Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 12 Jul 2022 04:52
Last Modified: 12 Jul 2022 04:52
URI: http://eprints.manipal.edu/id/eprint/158920

Actions (login required)

View Item View Item