Search Results - "Pavan, P. D."

  • Showing 1 - 7 results of 7
Refine Results
  1. 1

    On deeply critical oriented cliques by Duffy, Christopher, Pavan, PD., Sandeep, R. B., Sen, Sagnik

    Published in Journal of graph theory (01-09-2023)
    “…In this work we consider arc criticality in colourings of oriented graphs. We study deeply critical oriented graphs, those graphs for which the removal of any…”
    Get full text
    Journal Article
  2. 2

    On the oriented achromatic number of graphs by P.D., Pavan, Sopena, Éric

    Published in Discrete Applied Mathematics (15-04-2024)
    “…The oriented achromatic number of an oriented graph G⃗, denoted ψo(G⃗), is the largest n such that G⃗ admits a complete oriented n-colouring. If G is an…”
    Get full text
    Journal Article
  3. 3

    On fundamental results for pushable homomorphisms of oriented graphs by Das, Tapas, D, Pavan P, Sen, Sagnik, Taruni, S

    Published 11-10-2023
    “…This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push…”
    Get full text
    Journal Article
  4. 4

    Counting the minimum number of arcs in an oriented graph having weak diameter 2 by Das, Sandip, Dey, Koushik Kumar, D, Pavan P, Sen, Sagnik

    Published 03-04-2023
    “…An oriented graph has weak diameter at most $d$ if every non-adjacent pair of vertices are connected by a directed $d$-path. The function $f_d(n)$ denotes the…”
    Get full text
    Journal Article
  5. 5

    On Deeply Critical Oriented Cliques by Duffy, Christopher, D, Pavan P, B, Sandeep R, Sen, Sagnik

    Published 31-03-2021
    “…In this work we consider arc criticality in colourings of oriented graphs. We study deeply critical oriented graphs, those graphs for which the removal of any…”
    Get full text
    Journal Article
  6. 6

    Monitoring arc-geodetic sets of oriented graphs by Das, Tapas, Foucaud, Florent, Marcille, Clara, Pavan, PD, Sen, Sagnik

    Published 31-08-2024
    “…Monitoring edge-geodetic sets in a graph are subsets of vertices such that every edge of the graph must lie on all the shortest paths between two vertices of…”
    Get full text
    Journal Article
  7. 7

    Severe Hypertension in a 4-Year-Old Child by Dingman, Jeffrey R., MD, Zaveri, Pavan P., MD

    Published in Clinical pediatric emergency medicine (01-06-2007)
    “…[...]although essential hypertension is a diagnosis of exclusion, the severity of the hypertension and the patient's young age make this an unlikely…”
    Get full text
    Journal Article