Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Articles Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource ON BLOCK-RELATED DERIVED GRAPHS Subject The topic of the resource block cut point graph of a graph; block graph of a graph; block-degree; cut-degree Description An account of the resource This paper introduces and analyses the block-degree of a vertex and the cut-degree of a block. The block-degree of a vertex v is the number of blocks containing v. The cut-degree of a block b is the number of cut vertices of G contained in b. The block-degree sequence of cut vertices of the graph and the cut-degree sequence of the graph are defined. A few characterizations of the block-degree and cut-degree sequence of the graph are established. Given a graph, its block graph (B(G)) is a graph where each vertex represents a block, and two vertices are connected if their blocks intersect. The number of cut vertices of B(G) is determined. Further, an investigation is carried out on the traversability of B(G). A block cutpoint graph (BC(G)) of a graph represents a graph where each vertex corresponds to either a block or a cut vertex, and two vertices are connected if one represents a block and the other represents a cut vertex contained within that block. The properties of BC(G) and its iterations are studied. The graph G for which BC(G) is a perfect m-ary tree is characterized. 2024, Canadian University of Dubai. All rights reserved. Creator An entity primarily responsible for making the resource Baskar N.; Mangam T.A.; Rohith Raja M. Source A related resource from which the described resource is derived Gulf Journal of Mathematics, Vol-18, No. 2, pp. 70-86. Publisher An entity responsible for making the resource available Canadian University of Dubai Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.56947/gjom.v18i2.2284" target="_blank" rel="noreferrer noopener">https://doi.org/10.56947/gjom.v18i2.2284</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85212503722&amp;doi=10.56947%2Fgjom.v18i2.2284&amp;partnerID=40&amp;md5=36e92e60554e520a5269434796adbad0" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85212503722&amp;doi=10.56947%2fgjom.v18i2.2284&amp;partnerID=40&amp;md5=36e92e60554e520a5269434796adbad0</a> Rights Information about rights held in and over the resource All Open Access; Hybrid Gold Open Access Relation A related resource ISSN: 23094966 Format The file format, physical medium, or dimensions of the resource Online Language A language of the resource English Type The nature or genre of the resource Article Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Baskar N., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Rohith Raja M., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India