Results 281 to 290 of about 259,405 (306)
Some of the next articles are maybe not open access.
AIP Conference Proceedings, 2019
This article discusses a mixed graph called mixed hourglass graph. The adjacency of a mixed hourglass graph is coined from an hourglass matrix in which the matrix is obtained from quadratic interlocking factorization. Mixed hourglass graph is a weighted graph with loops, but replacing the weights of the graph with 1’s produce an unweighted mixed ...
Olayiwola Babarinsa +1 more
openaire +1 more source
This article discusses a mixed graph called mixed hourglass graph. The adjacency of a mixed hourglass graph is coined from an hourglass matrix in which the matrix is obtained from quadratic interlocking factorization. Mixed hourglass graph is a weighted graph with loops, but replacing the weights of the graph with 1’s produce an unweighted mixed ...
Olayiwola Babarinsa +1 more
openaire +1 more source
Optimal Mixed Graph Augmentation
SIAM Journal on Computing, 1987We consider an augmentation problem on mixed graphs that generalizes and unifies two augmentation problems considered by \textit{K. P. Eswaran} and \textit{R. E. Tarjan} [ibid. 5, 653-665 (1976; Zbl 0346.05112)]. The mixed augmentation problem has applications in the design of communication networks, and forms of mixed augmentation problem are central ...
openaire +1 more source
Mixed Roman Domination in Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahangar, H. Abdollahzadeh +2 more
openaire +3 more sources
1994
All of the situations considered earlier can be interpreted in terms of resource-constrained project scheduling. To do so, we introduce the concept of an Operation as some process having a certain duration and consuming certain resources. Each two operations may be either dependent or independent in the sense that the calendar time of one of them ...
V. S. Tanaev +2 more
openaire +1 more source
All of the situations considered earlier can be interpreted in terms of resource-constrained project scheduling. To do so, we introduce the concept of an Operation as some process having a certain duration and consuming certain resources. Each two operations may be either dependent or independent in the sense that the calendar time of one of them ...
V. S. Tanaev +2 more
openaire +1 more source
Linear and Multilinear Algebra, 2017
A mixed complete graph is obtained from a directed cycle of length at least three by adding all the possible arcs between any non-adjacent vertices of the underlying cycle. A mixed block graph is a strongly connected directed graph whose blocks are mixed complete graphs. In this paper, we give the inverse of the distance matrix of the mixed block graph.
Hui Zhou, Qi Ding
openaire +1 more source
A mixed complete graph is obtained from a directed cycle of length at least three by adding all the possible arcs between any non-adjacent vertices of the underlying cycle. A mixed block graph is a strongly connected directed graph whose blocks are mixed complete graphs. In this paper, we give the inverse of the distance matrix of the mixed block graph.
Hui Zhou, Qi Ding
openaire +1 more source
Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
MIXED GRAPH REPRESENTATION AND MIXED GRAPH ISOMORPHISM
2016Mixed graph is a graph containing oriented as well as un-oriented set of edges. The structural information conveyed by mixed graph is basically information where the edges of the graph are representations of roads, cables, telephone lines and other structures while the vertices are representations of high way intersections/squares, computers, telephone
openaire +1 more source
Organic mixed conductors for bioinspired electronics
Nature Reviews Materials, 2023Paschalis Gkoupidenis +2 more
exaly