Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Mkrtchyan, V. V." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    On strongly spanning k-edge-colorable subgraphs
    Autorzy:
    Mkrtchyan, V. V.
    Vardanyan, G. N.
    Powiązania:
    https://bibliotekanauki.pl/articles/255490.pdf
    Data publikacji:
    2017
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    k-edge-colorable subgraph
    maximum k-edge-colorable subgraph
    trongly spanning k-edge-colorable subgraph
    [1, k]-factor.
    Opis:
    A subgraph H of a multigraph G is called strongly spanning, if any vertex of G is not isolated in H. H is called maximum k-edge-colorable, if H is proper k-edge-colorable and has the largest size. We introduce a graph-parameter sp(G), that coincides with the smallest k for which a multigraph G has a maximum k-edge-colorable subgraph that is strongly spanning. Our first result offers some alternative definitions of sp(G). Next, we show that Δ (G) is an upper bound for sp(G), and then we characterize the class of multigraphs G that satisfy sp(G) = Δ (G). Finally, we prove some bounds for sp(G) that involve well-known graph-theoretic parameters.
    Źródło:
    Opuscula Mathematica; 2017, 37, 3; 447-456
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The hardness of the independence and matching clutter of a graph
    Autorzy:
    Hambardzumyan, S.
    Mkrtchyan, V. V.
    Musoyan, V. L.
    Sargsyan, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/952814.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    clutter
    hardness
    independent set
    maximal independent set
    matching
    maximal matching
    Opis:
    A clutter (or antichain or Sperner family) L is a pair (V, E), where V is a finite set and E is a family of subsets of V none of which is a subset of another. Usually, the elements of V are called vertices of L, and the elements of E are called edges of L. A subset se of an edge e of a clutter is called recognizing for e, if se is not a subset of another edge. The hardness of an edge e of a clutter is the ratio of the size of e's smallest recognizing subset to the size of e. The hardness of a clutter is the maximum hardness of its edges. We study the hardness of clutters arising from independent sets and matchings of graphs.
    Źródło:
    Opuscula Mathematica; 2016, 36, 3; 375-397
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Equitable Colorings Of Corona Multiproducts Of Graphs
    Autorzy:
    Furmánczyk, Hanna
    Kubale, Marek
    Mkrtchyan, Vahan V.
    Powiązania:
    https://bibliotekanauki.pl/articles/31341573.pdf
    Data publikacji:
    2017-11-27
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    corona graph
    equitable chromatic number
    equitable coloring conjecture
    equitable graph coloring
    multiproduct of graphs
    NP-completeness
    polynomial algorithm
    Opis:
    A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is known that the problem of computation of χ=(G) is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013) 103–120].
    Źródło:
    Discussiones Mathematicae Graph Theory; 2017, 37, 4; 1079-1094
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A method of using wastewater run-off from fish farms having no multi-use hydrosystem with water cleaning technologies
    Autorzy:
    Tokmajyan, Hovhannes V.
    Margaryan, Albert Ya.
    Mikayelyan, Aram R.
    Mkrtchyan, Samvel H.
    Powiązania:
    https://bibliotekanauki.pl/articles/31342623.pdf
    Data publikacji:
    2022
    Wydawca:
    Politechnika Częstochowska
    Tematy:
    gospodarstwa rybne
    nawadnianie
    głęboka studnia
    świeża woda
    ekologia wody
    fish farms
    irrigation
    deep well
    fresh water
    water ecology
    Opis:
    For industrial water use planning, water usage and drainage per unit product standards must be established. This would allow for the conservation of fresh water resources without limiting irrigation in the face of the world’s ever-increasing drinking water deficit. Because fish farms use a lot of water, businesses that raise fish in artificial ponds usually dig deep wells to get to the valuable subsurface water they need. Because they lack a reusable water system equipped with treatment technologies, they typically discharge water into the environment after a single use, resulting in marshes, soil salinization, or transportation with surface water flow to the brackish water ecosystem. In recent years, the use of groundwater for fishing has spread in Armenia’s Ararat plain, one of the country’s most important agricultural regions. The Ararat plain has a water shortage for irrigation, which is mostly addressed by increasing water intake volumes from Lake Sean, a critical source of drinking water. In the absence of a multi-use hydrosystem with cleaning technologies, a method of utilizing fish farm wastewater for irrigation purposes is proposed as a water-saving and environmental-protection approach.
    Źródło:
    Budownictwo o Zoptymalizowanym Potencjale Energetycznym; 2022, 11; 155-161
    2299-8535
    2544-963X
    Pojawia się w:
    Budownictwo o Zoptymalizowanym Potencjale Energetycznym
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies