Results 21 to 30 of about 259,405 (306)
Discrete Mathematics & Theoretical Computer Science, 2023 Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Geoffrey Exoo
doaj +1 more source
Moore mixed graphs from Cayley graphs
Electronic Journal of Graph Theory and Applications, 2023 This research has been partially supported by AGAUR from the Catalan Government under project 2021SGR00434 and MICINN from the Spanish Government under project PID2020-115442RBI00.
Dalfó Simó, Cristina +1 more
openaire +2 more sources
Discrete Applied Mathematics, 2017 A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the ...
Dalfó Simó, Cristina +2 more
openaire +5 more sources
MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs [PDF]
Neutrosophic Sets and SystemsGraph theory examines networks consisting of nodes (vertices) and the connections (edges) between them. Mixed graphs, which combine both undirected and directed edges, provide a versatile framework for representing relationships with symmetric and ...
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
Rational mixed Tate motivic graphs [PDF]
Annals of K-Theory, 2017 53 ...
Patashnick, Owen A, Agarwala, Susama
openaire +5 more sources
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Transactions on Combinatorics, 2018 Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
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
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
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