Search results for: Roman Jurisprudence 💚

• Jurisprudence

  Journals

  ISSN: 1802-3843

• Analecta Romana Instituti Danici. Roma

  Journals

  ISSN: 0066-1392

• Progress on Roman and Weakly Connected Roman Graphs

  Publication

  • J. Raczek
  • R. Zuazua

  - Mathematics - Year 2021

  A graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....

  Full text available to download

• The American journal of jurisprudence

  Journals

  ISSN: 0065-8995

• International Comparative Jurisprudence

  Journals

  eISSN: 2351-6674

• Journal of Roman Studies

  Journals

  ISSN: 0075-4358 , eISSN: 1753-528X

• Journal of Roman Archaeology

  Journals

  ISSN: 1047-7594 , eISSN: 2331-5709

• Religion in the Roman Empire

  Journals

  ISSN: 2199-4463 , eISSN: 2199-4471

• Canadian Journal of Law and Jurisprudence

  Journals

  ISSN: 0841-8209 , eISSN: 2056-4260

• Weakly connected Roman domination in graphs

  Publication

  • J. Raczek
  • J. Cyman

  - DISCRETE APPLIED MATHEMATICS - Year 2019

  A Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...

  Full text available to download