BibTeX records: Kamal Lochan Patra

download as .bib file

@article{DBLP:journals/dm/DalalMP24,
  author       = {Sandeep Dalal and
                  Sanjay Mukherjee and
                  Kamal Lochan Patra},
  title        = {On the super graphs and reduced super graphs of some finite groups},
  journal      = {Discret. Math.},
  volume       = {347},
  number       = {1},
  pages        = {113728},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disc.2023.113728},
  doi          = {10.1016/J.DISC.2023.113728},
  timestamp    = {Mon, 30 Oct 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DalalMP24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/PandeyP22,
  author       = {Dinesh Pandey and
                  Kamal Lochan Patra},
  title        = {A Conjecture on Different Central Parts of Binary Trees},
  journal      = {Graphs Comb.},
  volume       = {38},
  number       = {6},
  pages        = {190},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00373-022-02596-7},
  doi          = {10.1007/S00373-022-02596-7},
  timestamp    = {Thu, 08 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/gc/PandeyP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChattopadhyayPS19,
  author       = {Sriparna Chattopadhyay and
                  Kamal Lochan Patra and
                  Binod Kumar Sahoo},
  title        = {Vertex connectivity of the power graph of a finite cyclic group},
  journal      = {Discret. Appl. Math.},
  volume       = {266},
  pages        = {259--271},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2018.06.001},
  doi          = {10.1016/J.DAM.2018.06.001},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChattopadhyayPS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/PatraS17,
  author       = {Kamal Lochan Patra and
                  Binod Kumar Sahoo},
  title        = {Bounds for the Laplacian spectral radius of graphs},
  journal      = {Electron. J. Graph Theory Appl.},
  volume       = {5},
  number       = {2},
  pages        = {276--303},
  year         = {2017},
  url          = {https://doi.org/10.5614/ejgta.2017.5.2.10},
  doi          = {10.5614/EJGTA.2017.5.2.10},
  timestamp    = {Fri, 03 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejgta/PatraS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PatraSS16,
  author       = {Kamal Lochan Patra and
                  Binod Kumar Sahoo and
                  Bikramaditya Sahu},
  title        = {Minimum size blocking sets of certain line sets related to a conic
                  in PG(2, q)},
  journal      = {Discret. Math.},
  volume       = {339},
  number       = {6},
  pages        = {1716--1721},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.disc.2016.01.010},
  doi          = {10.1016/J.DISC.2016.01.010},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/PatraSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LalPS11,
  author       = {Arbind Kumar Lal and
                  Kamal Lochan Patra and
                  Binod Kumar Sahoo},
  title        = {Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant
                  Vertices},
  journal      = {Graphs Comb.},
  volume       = {27},
  number       = {2},
  pages        = {215--229},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00373-010-0975-0},
  doi          = {10.1007/S00373-010-0975-0},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/LalPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics