A. N. M. Salman

Orcid: 0000-0001-6895-6234

According to our database1, A. N. M. Salman authored at least 34 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the inverse graph of a finite group and its rainbow connection number.
Electron. J. Graph Theory Appl., 2023

On (F, H)-simultaneously-magic labelings of graphs.
Electron. J. Graph Theory Appl., 2023

2022
Rainbow connection number of comb product of graphs.
Electron. J. Graph Theory Appl., 2022

The strong 3-rainbow index of edge-comb product of a path and a connected graph.
Electron. J. Graph Theory Appl., 2022

2021
On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs.
Symmetry, 2021

Complete bipartite graph is a totally irregular total graph.
Electron. J. Graph Theory Appl., 2021

2020
The Strong 3-rainbow Index of Comb Product of a Tree and a Connected Graph.
J. Inf. Process., 2020

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths.
Electron. J. Graph Theory Appl., 2020

The total face irregularity strength of some plane graphs.
AKCE Int. J. Graphs Comb., 2020

2016
Rainbow connection number of amalgamation of some graphs.
AKCE Int. J. Graphs Comb., 2016

2015
Total Irregularity Strength of Three Families of Graphs.
Math. Comput. Sci., 2015

On the Total Irregularity Strength of Fan, Wheel, Triangular Book, and Friendship Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Upper Bounds for Rainbow 2-Connectivity of the Cartesian Product of a Path and a Cycle.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Rainbow (Vertex) Connection Number of Pencil Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Rainbow Connection Number of an n-Crossed Prism Graph and its Corona Product with a Trivial Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P<sub>2</sub> and an Arbitrary Regular Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Rainbow Connection Number of Origami Graphs and Pizza Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Rainbow Connection Number of a Flower (C<sub>m</sub>, K<sub>n</sub>) Graph and a Flower (C<sub>3</sub>, F<sub>n</sub>) Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

2013
The metric dimension of the lexicographic product of graphs.
Discret. Math., 2013

Supermagic coverings of the disjoint union of graphs and amalgamations.
Discret. Math., 2013

Super (a, d)-H-antimagic total labelings for shackles of a connected graph H.
Australas. J Comb., 2013

2011
On graph of order-n with the metric dimension n-3.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
On the total vertex irregularity strength of trees.
Discret. Math., 2010

H-supermagic labelings of graphs.
Discret. Math., 2010

2009
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.
Discuss. Math. Graph Theory, 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discret. Math., 2009

2007
On Ramsey numbers for paths versus wheels.
Discret. Math., 2007

Path-kipas Ramsey numbers.
Discret. Appl. Math., 2007

Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.
Proceedings of the Computational Geometry and Graph Theory, 2007

2006
Path-fan Ramsey numbers.
Discret. Appl. Math., 2006

2004
The Ramsey Numbers of Paths Versus Kipases.
Electron. Notes Discret. Math., 2004

2003
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.
J. Autom. Lang. Comb., 2003

The Ramsey Numbers of Paths Versus Fans.
Electron. Notes Discret. Math., 2003


  Loading...