Christ University

output

20052026

most citedThe Astropy Project: Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package

5k citations

researchers with a paper here

collaborating institutions

Showing math.COShow all

18 papers · 1 filter

math.CO2024

Dom-forcing sets in graphs

Susanth P, Charles Dominic, Premodkumar K P

A dominating set $D_{f} \subseteq V (G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $⟨ D_{f} ⟩$ must form a zero forcing se…

math.CO2020★ 5 cited

Parity Labeling in Signed Graphs

Mukti Acharya, Joseph Varghese Kureethara

Let $S = (G, σ)$ be a signed graph where $G = (V, E)$ is a graph called the underlying graph of $S$ and $σ : E (G) \to {+, -}$ . Let $f : V (G) \to {1, 2, \dots, ∣ V (G) ∣}$ suc…

math.CO2020★ 1 cited

Characterizations of Some Parity Signed Graphs

Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky

We describe parity labelings of signed graphs; equivalently, cuts of the underlying graph that have nearly equal sides. We characterize the balanced signed graphs which are parity…

math.CO2019★ 1 cited

Structural domination and coloring of some ( $P_{7}, C_{7}$ )-free graphs

S. A. Choudum, T. Karthick, Manoj M. Belavadi

We show that every connected induced subgraph of a graph $G$ is dominated by an induced connected split graph if and only if $G$ is $C$ -free, where $C$ is a set of six…

math.CO2017

L(t, 1)-Colouring of Graphs

Priyanka Pandey, Joseph Varghese Kureethara

One of the most famous applications of Graph Theory is in the field of Channel Assignment Problems. There are varieties of graph colouring concepts that are used for different requ…

math.CO2014★ 5 cited

Further Studies on the Sparing Number of Graphs

N K Sudev, K A Germina

Let $N_{0}$ denote the set of all non-negative integers and $P (N_{0})$ be its power set. An integer additive set-indexer is an injective function $f:V(G)\to…