Results 231 to 240 of about 2,253,480 (276)
Graph-Enhanced Expectation Maximization for Emission Tomography. [PDF]
Kasai R, Otsuka H.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bu, Tianyi, Huang, Shaobin
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bu, Tianyi, Huang, Shaobin
openaire +2 more sources
2021
In this chapter, we study certain graphs obtained from total graphs of commutative rings. More specifically, we concentrate on the total graph without the zero element, the complement of the total graph, and its generalizations.
David F. Anderson +3 more
openaire +1 more source
In this chapter, we study certain graphs obtained from total graphs of commutative rings. More specifically, we concentrate on the total graph without the zero element, the complement of the total graph, and its generalizations.
David F. Anderson +3 more
openaire +1 more source
International Journal of Foundations of Computer Science, 2014
Communication networks must be constructed to be as stable as possible, not only with the respect to the initial disruption, but also with respect to the possible reconstruction. Many graph theoretical parameters have been used to describe the stability of communication networks.
Li, Yinkui +3 more
openaire +1 more source
Communication networks must be constructed to be as stable as possible, not only with the respect to the initial disruption, but also with respect to the possible reconstruction. Many graph theoretical parameters have been used to describe the stability of communication networks.
Li, Yinkui +3 more
openaire +1 more source
Uniquely Total Colorable Graphs
Graphs and Combinatorics, 1997A total coloring of a graph is an assignment of colors to the vertices and edges of the graph so that no two adjacent edges have the same color, no two adjacent vertices have the same color and no vertex and an incident edge have the same color. The minimum number of colors needed by a total coloring is called the total chromatic number and is denoted \
Akbari, S. +3 more
openaire +2 more sources

