Results 41 to 50 of about 937,585 (316)
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$ such that every element $x \in (V \cup E) \backslash S$ is either adjacent or incident to an element of $S$. The mixed domination number of a graph $G$, denoted by $\gamma_m(G)$
M. Rajaati +3 more
doaj +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
Mixed formulation of the one-dimensional equilibrium model for elastic stents [PDF]
, 2017 In this paper we formulate and analyze the mixed formulation of the one-dimensional equilibrium model of elastic stents. The model is based on the curved rod model for the inextensible and ushearable struts and is formulated in the weak form in \v{C}ani\'
Grubišić, Luka +3 more
core +3 more sources
Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
Journal of Inequalities and Applications, 2017 Let M be a mixed graph and H ( M ) $H(M)$ be its Hermitian-adjacency matrix. If we add a Randić weight to every edge and arc in M, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix?
Yong Lu, Ligong Wang, Qiannan Zhou
doaj +1 more source
A new general family of mixed graphs [PDF]
Discrete Applied Mathematics, 2019 A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute the best infinite families with asymptotically optimal (or quasi-optimal) diameter for their number of ...
C. Dalfó
openalex +6 more sources
Discrete Mathematics, 2007 The Moore bound for a directed graph of maximum out-degree d and diameter k is M"d","k=1+d+d^2+...+d^k. It is known that digraphs of order M"d","k (Moore digraphs) do not exist for d>1 and k>1. Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is M"d","k^*=1+d+d(d-1)+...+d(d-1)^k^-^1.
Joan Gimbert +2 more
openaire +2 more sources
The mixed page number of graphs
Theoretical Computer Science, 2022 A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout.
Jawaherul Md. Alam +4 more
openaire +2 more sources
Computing Fault-Tolerant Metric Dimension of Connected Graphs
Journal of Mathematics, 2022 For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures.
Uzma Ahmad +3 more
doaj +1 more source
Discrete Mathematics, 2019 Abstract Let n , s be integers, n ≥ 2 ( s + 1 ) ≥ 4 . Let F , G ⊂ [ n ] 2 be two graphs. We determine the exact maximum of | F | + | G | subject to the condition that there is no matching of size s + 1 contained in F ∪ G and having non-empty intersection with ...
Péter Frankl
openalex +3 more sources
Locally Differentially Private Heterogeneous Graph Aggregation with Utility Optimization
Entropy, 2023 Graph data are widely collected and exploited by organizations, providing convenient services from policy formation and market decisions to medical care and social interactions.
Zichun Liu +3 more
doaj +1 more source