Results 211 to 220 of about 5,134,655 (243)

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Global stabilization of Boolean networks with applications to biomolecular network control. [PDF]

Sci Rep
Rafimanzelat MR.
europepmc   +1 more source

PhaseGen: exact solutions for time-inhomogeneous multivariate coalescent distributions under diverse demographies. [PDF]

Genetics
Sendrowski J, Hobolth A.
europepmc   +1 more source

About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability

, 2016
Philippe Balbiani
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Antimagicness of Lexicographic Product Graph G[Pn]

Acta Mathematicae Applicatae Sinica, English Series, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yingyu Lu, Guanghua Dong, Ning Wang
semanticscholar   +3 more sources

Double total domination in the generalized lexicographic product of graphs

Quaestiones Mathematicae. Journal of the South African Mathematical Society, 2023
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).
A. Cabrera-Martínez, Ismael Ríos Villamar, J. M. Rueda-Vázquez, J. M. Sigarreta Almira   +3 more
semanticscholar   +1 more source

Weakly connected 2-domination in the lexicographic product of graphs

International Journal of Mathematical Analysis, 2022
Let G = ( V ( G ) , E ( G )) be a connected graph. A weakly connected 2-dominating set of G is a set D of vertices of G such that every vertex in V ( G ) \ D has at least two neighbors in D and the subgraph (cid:104) D (cid:105) w weakly induced by D is ...
Mae P. Militante, R. Eballe
semanticscholar   +1 more source

Lexicographic products in metarouting

2007 IEEE International Conference on Network Protocols, 2007
Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the most important attribute of each route is considered first, and if this does not give enough information to decide which route is better, the next attribute is considered; and so
Alexander J. T. Gurney, Timothy G. Griffin   +1 more
openaire   +1 more source

Total colorings of certain classes of lexicographic product graphs

Discret. Math. Algorithms Appl., 2021
A total coloring of a graph G is an assignment of colors to all the elements (vertices and edges) of the graph in such a way that no two adjacent or incident elements receive the same color.
T. Sandhiya, J. Geetha, K. Somasundaram
semanticscholar   +1 more source