DIKUL - logo

Rezultati iskanja

Osnovno iskanje    Izbirno iskanje   
Iskalna
zahteva
Knjižnica

Trenutno NISTE avtorizirani za dostop do e-virov UL. Za polni dostop se PRIJAVITE.

1 2 3 4 5
zadetkov: 311
21.
  • Lindelöfness of lexicograph... Lindelöfness of lexicographic products of GO-spaces
    Mou, Lei; Xu, Yanqin Topology and its applications, 06/2022, Letnik: 314
    Journal Article
    Recenzirano

    In this paper, we consider when a lexicographic product of GO-spaces is Lindelöf. We mainly prove: (1) Let γ be any ordinal. Assume that for each α<γ, Xα is a Lindelöf GO-space, and for each α≥1, Xα ...
Celotno besedilo
Dostopno za: UL
22.
  • The metric dimension of the... The metric dimension of the lexicographic product of graphs
    Jannesari, Mohsen; Omoomi, Behnaz Discrete mathematics, 11/2012, Letnik: 312, Številka: 22
    Journal Article
    Recenzirano
    Odprti dostop

    For a set W of vertices and a vertex v in a connected graph G, the k-vector rW(v)=(d(v,w1),…,d(v,wk)) is the metric representation of v with respect to W, where W={w1,…,wk} and d(x,y) is the distance ...
Celotno besedilo
Dostopno za: UL

PDF
23.
  • The spectra of graphs based... The spectra of graphs based on general graph operations
    Ma, Xiaoling; Lu, Zhiqin Linear & multilinear algebra, 12/2023, Letnik: 71, Številka: 18
    Journal Article
    Recenzirano

    For two graphs $ G_1 $ G 1 and $ G_2 $ G 2 . Let $ \mathcal {B} $ B be a set of non-zero binary 2-tuples, i.e. $ \mathcal {B}\subseteq \{0,1\}^{2}\setminus \{(0,0)\} $ B ⊆ { 0 , 1 } 2 ∖ { ( 0 , 0 ) } ...
Celotno besedilo
Dostopno za: UL
24.
  • The metric dimension of the... The metric dimension of the lexicographic product of graphs
    Saputro, S.W.; Simanjuntak, R.; Uttunggadewa, S. ... Discrete mathematics, 05/2013, Letnik: 313, Številka: 9
    Journal Article
    Recenzirano
    Odprti dostop

    A set of vertices Wresolves a graph G if every vertex is uniquely determined by its coordinate of distances to the vertices in W. The minimum cardinality of a resolving set of G is called the metric ...
Celotno besedilo
Dostopno za: UL

PDF
25.
  • Regular Property on Product... Regular Property on Product of Pythagorean Anti Fuzzy Graph
    Maheswari, V.; Syedul Fahima, U.; Bala Deepa Arasi, K. Journal of physics. Conference series, 06/2021, Letnik: 1947, Številka: 1
    Journal Article
    Recenzirano
    Odprti dostop

    Abstract In this paper, we introduce the notion of Pythagorean Anti fuzzy graph. We then define the Cartesian product and Lexicographic product on Pythagorean Anti fuzzy graph. It is proved that ...
Celotno besedilo
Dostopno za: UL

PDF
26.
  • On the weak Roman dominatio... On the weak Roman domination number of lexicographic product graphs
    Valveny, Magdalena; Pérez-Rosés, Hebert; Rodríguez-Velázquez, Juan A. Discrete Applied Mathematics, 06/2019, Letnik: 263
    Journal Article
    Recenzirano
    Odprti dostop

    A vertex v of a graph G=(V,E) is said to be undefended with respect to a function f:V⟶{0,1,2} if f(v)=0 and f(u)=0 for every vertex u adjacent to v. We call the function f a weak Roman dominating ...
Celotno besedilo
Dostopno za: UL

PDF
27.
  • Total Coloring Conjecture f... Total Coloring Conjecture for Certain Classes of Graphs
    Vignesh, R.; Geetha, J.; Somasundaram, K. Algorithms, 10/2018, Letnik: 11, Številka: 10
    Journal Article
    Recenzirano
    Odprti dostop

    A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color. The total chromatic number of a graph G, ...
Celotno besedilo
Dostopno za: UL

PDF
28.
  • Hop Dominating Sets in Grap... Hop Dominating Sets in Graphs Under Binary Operations
    Canoy, Jr, Sergio; Mollejon, Reynaldo Villarobe; Canoy, John Gabriel E. European journal of pure and applied mathematics, 01/2019, Letnik: 12, Številka: 4
    Journal Article
    Recenzirano
    Odprti dostop

    Let G be a (simple) connected graph with vertex and edge sets V (G) and E(G),respectively. A set S ⊆ V (G) is a hop dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such that ...
Celotno besedilo
Dostopno za: UL

PDF
29.
  • Edge-coloring of generalize... Edge-coloring of generalized lexicographic product of graphs
    Tian, Shuangliang; Chen, Ping AIMS mathematics, 01/2024, Letnik: 9, Številka: 6
    Journal Article
    Recenzirano
    Odprti dostop

    An edge-coloring of a graph $ G $ is an assignment of colors to its edges so that no two edges incident to the same vertex receive the same color. The chromatic index of $ G $, denoted by $ \chi'(G) ...
Celotno besedilo
Dostopno za: UL
30.
  • Double total domination in ... Double total domination in the generalized lexicographic product of graphs
    Cabrera-Martínez, Abel; Villamar, Ismael Ríos; Rueda-Vázquez, Juan M. ... Quaestiones mathematicae, 03/2024, Letnik: 47, Številka: 3
    Journal Article
    Recenzirano

    Let G be a graph of minimum degree at least two. A set D ⊆ V(G) is said to be a double total dominating set of G if |N (v) ∩ D| ≥ 2 for every vertex v ∈ V(G). The double total domination number of G, ...
Celotno besedilo
Dostopno za: UL
1 2 3 4 5
zadetkov: 311

Nalaganje filtrov