Search results for: block graph - Bridge of Knowledge

Search

Search results for: block graph

Best results in : Research Potential Pokaż wszystkie wyniki (22)

Search results for: block graph

Best results in : Business Offer Pokaż wszystkie wyniki (1)

Search results for: block graph

  • Środowiskowe Laboratorium Technologii Bezprzewodowych

    Środowiskowe Laboratorium Technologii Bezprzewodowych powstało w ramach realizacji projektu CZT Centrum Zaawansowanych Technologii POMORZE i mieści się w Katedrze Inżynierii Mikrofalowej i Antenowej na Wydziale Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej. Laboratorium zostało wyposażone w specjalistyczne zaplecze aparaturowe, które w połączeniu z kompetencjami naukowymi i technologicznymi kadry pozwala na...

Other results Pokaż wszystkie wyniki (9)

Search results for: block graph

  • Block graphs with large paired domination multisubdivision number

    Publication

    - Discussiones Mathematicae Graph Theory - Year 2021

    The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.

    Full text available to download

  • Approximation algorithms for job scheduling with block-type conflict graphs

    Publication

    - COMPUTERS & OPERATIONS RESEARCH - Year 2024

    The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...

    Full text to download in external service

  • Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

    Publication
    • M. Lemańska
    • J. A. RODRíGUEZ-VELáZQUEZ
    • R. Trujillo-Rasua

    - FUNDAMENTA INFORMATICAE - Year 2017

    A vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...

    Full text to download in external service

  • Graphs with isolation number equal to one third of the order

    Publication

    - DISCRETE MATHEMATICS - Year 2024

    A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...

    Full text to download in external service

  • Common Independence in Graphs

    Publication

    - Symmetry-Basel - Year 2021

    Abstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...

    Full text available to download