Results 251 to 260 of about 712,475 (276)

Mixed Roman Domination in Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahangar, H. Abdollahzadeh, Haynes, Teresa W., Valenzuela-Tripodoro, J. C.   +2 more
openaire   +3 more sources

Optimal Mixed Graph Augmentation

SIAM Journal on Computing, 1987
We 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

Mixing spectral representations of graphs

18th International Conference on Pattern Recognition (ICPR'06), 2006
Generative models are well known in the domain of statistical pattern recognition. Typically, they describe the probability distribution of patterns in a vector space. The individual patterns are defined by vectors and so the individual features of the pattern are well defined.
David H. White 0001, Richard C. Wilson 0001   +1 more
openaire   +1 more source

Mixed Connectivity of Random Graphs

2017
For positive integers k and \(\lambda \), a graph G is \((k,\lambda )\)-connected if it satisfies the following two conditions: (1) \(|V(G)|\ge k+1\), and (2) for any subset \(S\subseteq V(G)\) and any subset \(L\subseteq E(G)\) with \(\lambda |S|+|L|
Ran Gu, Yongtang Shi, Neng Fan
openaire   +1 more source

Oriented Paths in Mixed Graphs

2004
We consider mixed graphs with directed and undirected edges A path in a mixed graph is called oriented if it has at least one directed edge We show that 1.) oriented paths can be found in polynomial time, 2.) computing a maximal number of mutually edge-disjoint oriented s,t-paths is NP-complete, and 3.) computing a minimal set of edges or vertices ...
Egon Wanke, Rolf Kötter
openaire   +1 more source

Unilateral Orientation of Mixed Graphs

2010
A digraph D is unilateral if for every pair x, y of its vertices there exists a directed path from x to y, or a directed path from y to x, or both. A mixed graph M = (V,A,E) with arc-set A and edge-set E accepts a unilateral orientation, if its edges can be oriented so that the resulting digraph is unilateral. In this paper, we present the first linear-
Tamara Mchedlidze, Antonios Symvonis
openaire   +1 more source

Fast-Mixed Searching on Graphs

2012
We introduce the fast-mixed search model, which is a combination of the fast search model and the mixed search model. We establish relations between the fast-mixed search problem and other graph search problems. We also establish relations between the fast-mixed search problem and the induced-path cover problem.
openaire   +1 more source

MIXED GRAPH REPRESENTATION AND MIXED GRAPH ISOMORPHISM

2016
Mixed 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

Mixed metric dimension of graphs with edge disjoint cycles

Discrete Applied Mathematics, 2021
Jelena Sedlar, Riste Skrekovski
exaly  

Graphs whose mixed metric dimension is equal to their order

Computational and Applied Mathematics, 2023
Sandi Klavzar, Mostafa Tavakoli
exaly