Manoj Changat

Orcid: 0000-0001-7257-6031

Affiliations:
  • University of Kerala, Thiruvananthapuram, India
  • Cochin University of Science and Technology, India (PhD 1991)


According to our database1, Manoj Changat authored at least 79 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weakly modular graphs with diamond condition, the interval function and axiomatic characterizations.
CoRR, 2024

Transit Functions and Clustering Systems.
CoRR, 2024

The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
Center and periphery of lexicographic product of digraphs.
Art Discret. Appl. Math., February, 2023

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs.
CoRR, 2023

Segment Transit Function of the Induced Path Function of Graphs and Its First-Order Definability.
Proceedings of the Logic and Its Applications - 10th Indian Conference, 2023

Axiomatic Characterization of the Toll Walk Function of Some Graph Classes.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Composition and product of cover-incomparability graphs.
Art Discret. Appl. Math., December, 2022

Ptolemaic and Chordal Cover-Incomparability Graphs.
Order, 2022

Preface: CALDAM 2020.
Discret. Appl. Math., 2022

The median of Sierpiński graphs.
Discret. Appl. Math., 2022

First-order logic axiomatization of metric graph theory.
CoRR, 2022

Comparability Graphs Among Cover-Incomparability Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Ptolemaic and Planar Cover-incomparability Graphs.
Order, 2021

On the General Position Number of Complementary Prisms.
Fundam. Informaticae, 2021

A framework for inventor collaboration recommendation system based on network approach.
Expert Syst. Appl., 2021

Boundary-type sets of strong product of directed graphs.
Ars Math. Contemp., 2021

Cut Vertex Transit Functions of Hypergraphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

Lexicographic Product of Digraphs and Related Boundary-Type Sets.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

Axiomatic Characterization of the Median Function of a Block Graph.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
On the Carathéodory and exchange numbers of geodetic convexity in graphs.
Theor. Comput. Sci., 2020

Computing the hull number in Δ-convexity.
Theor. Comput. Sci., 2020

A framework towards bias-free contextual productivity assessment.
Scientometrics, 2020

Axiomatic characterization of the interval function of a bipartite graph.
Discret. Appl. Math., 2020

Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations.
Discret. Appl. Math., 2020

The Interval function, Ptolemaic, distance hereditary, bridged graphs and axiomatic characterizations.
CoRR, 2020

Transit sets of -point crossover operators.
AKCE Int. J. Graphs Comb., 2020

2019
Characterization of general position sets and its applications to cographs and bipartite graphs.
Appl. Math. Comput., 2019

Betweenness in graphs: A short survey on shortest and induced path betweenness.
AKCE Int. J. Graphs Comb., 2019

Axiomatic characterization of transit functions of weak hierarchies.
Art Discret. Appl. Math., 2019

2018
Towards prediction of paradigm shifts from scientific literature.
Scientometrics, 2018

An integrated approach to path analysis for weighted citation networks.
Scientometrics, 2018

A note on the interval function of a disconnected graph.
Discuss. Math. Graph Theory, 2018

Axiomatic characterization of the center function. The case of non-universal axioms.
Discret. Appl. Math., 2018

Axiomatic characterization of transit functions of hierarchies.
Ars Math. Contemp., 2018

The Edge Geodetic Number of Product Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
Contextual productivity assessment of authors and journals: a network scientometric approach.
Scientometrics, 2017

Citation Networks Analysis: A New tool for Understanding Science Dynamics with Implications Towards Science Policy.
J. Sci. Res., 2017

Axiomatic characterization of the center function. The case of universal axioms.
Discret. Appl. Math., 2017

Axiomatic characterization of the median and antimedian function on a complete graph minus a matching.
Discret. Appl. Math., 2017

Topological Representation of the Transit Sets of k-Point Crossover Operators.
CoRR, 2017

2016
Directed graphs and its Boundary Vertices.
CoRR, 2016

Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

On the Center Sets of Some Graph Classes.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Cographs Which are Cover-Incomparability Graphs of Posets.
Order, 2015

Algorithms for the remoteness function, and the median and antimedian sets in ℓ<sub>1</sub>-graphs.
Int. J. Comput. Sci. Math., 2015

Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs.
Discret. Math. Algorithms Appl., 2015

Axiomatic characterization of the interval function of a block graph.
Discret. Math., 2015

The median game.
Discret. Optim., 2015

Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Some Steiner concepts on lexicographic products of graphs.
Discret. Math. Algorithms Appl., 2014

Equal opportunity networks, distance-balanced graphs, and Wiener game.
Discret. Optim., 2014

Affiliations network analysis in scientific citations: A case study of information technology for engineering.
Proceedings of the International Conference on Data Science & Engineering, 2014

2013
A forbidden subgraph characterization of some graph classes using betweenness axioms.
Discret. Math., 2013

On The Center Sets and Center Numbers of Some Graph Classes.
CoRR, 2013

Consensus strategies for signed profiles on graphs.
Ars Math. Contemp., 2013

2012
Convex Sets in Lexicographic Products of Graphs.
Graphs Comb., 2012

Axiomatic Characterization of the antimedian Function on Paths and Hypercubes.
Discret. Math. Algorithms Appl., 2012

2011
A note on 3-Steiner intervals and betweenness.
Discret. Math., 2011

2010
Simultaneous embeddings of graphs as median and antimedian subgraphs.
Networks, 2010

<i>n</i>-ary transit functions in graphs.
Discuss. Math. Graph Theory, 2010

The periphery graph of a median graph.
Discuss. Math. Graph Theory, 2010

The induced path function, monotonicity and betweenness.
Discret. Appl. Math., 2010

Cover-incomparability graphs and chordal graphs.
Discret. Appl. Math., 2010

Computing median and antimedian sets in median graphs.
Algorithmica, 2010

The plurality strategy on graphs.
Australas. J Comb., 2010

2009
Strongly distance-balanced graphs and graph products.
Eur. J. Comb., 2009

Triangle path transit functions, betweenness and pseudo-modular graphs.
Discret. Math., 2009

Steiner intervals, geodesic intervals, and betweenness.
Discret. Math., 2009

On the remoteness function in median graphs.
Discret. Appl. Math., 2009

Characterizing posets for which their natural transit functions coincide.
Ars Math. Contemp., 2009

2008
Cover-Incomparability Graphs of Posets.
Order, 2008

The median function on graphs with bounded profiles.
Discret. Appl. Math., 2008

Antimedian graphs.
Australas. J Comb., 2008

2005
Convexities related to path properties on graphs.
Discret. Math., 2005

2004
Induced path transit function, monotone and Peano axioms.
Discret. Math., 2004

2003
Induced Path Transit Function, Betweenness and Monotonicity.
Electron. Notes Discret. Math., 2003

1999
On triangle path convexity in graphs.
Discret. Math., 1999


  Loading...