An Extension of ABC Matrix and ABC Energy for Mixed Graphs

2018 ◽  
Vol 9 (6) ◽  
pp. 513-519
Author(s):  
A. Bharali
Keyword(s):  
Mixed Graphs

Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs

2017 ◽  
Vol 293 ◽  
pp. 287-292 ◽  
Author(s):  
Guihai Yu ◽  
Xin Liu ◽  
Hui Qu
Keyword(s):  
Laplacian Matrix ◽  
Mixed Graphs

scholarly journals On Weak Chromatic Polynomials of Mixed Graphs

2013 ◽  
Vol 31 (1) ◽  
pp. 91-98 ◽  
Author(s):  
Matthias Beck ◽  
Daniel Blado ◽  
Joseph Crawford ◽  
Taïna Jean-Louis ◽  
Michael Young
Keyword(s):  
Chromatic Polynomials ◽  
Mixed Graphs

scholarly journals Markov properties for mixed graphs

Bernoulli ◽  
2014 ◽  
Vol 20 (2) ◽  
pp. 676-696 ◽  
Author(s):  
Kayvan Sadeghi ◽  
Steffen Lauritzen
Keyword(s):  
Mixed Graphs ◽  
Markov Properties

scholarly journals On Total Regularity of Mixed Graphs with Order Close to the Moore Bound

2019 ◽  
Vol 35 (6) ◽  
pp. 1253-1272
Author(s):  
James Tuite ◽  
Grahame Erskine
Keyword(s):  
Open Problem ◽  
Mixed Graph ◽  
Difficult Question ◽  
Moore Graph ◽  
Network Topologies ◽  
Mixed Graphs

Abstract The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of mixed graphs, i.e. networks that admit both undirected edges and directed arcs. The degree/diameter problem for mixed graphs asks for the largest possible order of a network with diameter k, maximum undirected degree $$\le r$$≤r and maximum directed out-degree $$\le z$$≤z. Similarly one can search for the smallest possible k-geodetic mixed graphs with minimum undirected degree $$\ge r$$≥r and minimum directed out-degree $$\ge z$$≥z. A simple counting argument reveals the existence of a natural bound, the Moore bound, on the order of such graphs; a graph that meets this limit is a mixed Moore graph. Mixed Moore graphs can exist only for $$k = 2$$k=2 and even in this case it is known that they are extremely rare. It is therefore of interest to search for graphs with order one away from the Moore bound. Such graphs must be out-regular; a much more difficult question is whether they must be totally regular. For $$k = 2$$k=2, we answer this question in the affirmative, thereby resolving an open problem stated in a recent paper of López and Miret. We also present partial results for larger k. We finally put these results to practical use by proving the uniqueness of a 2-geodetic mixed graph with order exceeding the Moore bound by one.

scholarly journals Mixed Moore Cayley Graphs

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741010
Author(s):  
GRAHAME ERSKINE
Keyword(s):  
Infinite Number ◽  
Upper Bound ◽  
Maximum Degree ◽  
Cayley Graphs ◽  
Computational Techniques ◽  
Elementary Group ◽  
Recent Interest ◽  
Mixed Graphs ◽  
Rule Out

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected edges and directed arcs in the graph. For a diameter 2 graph with maximum undirected degree r and directed out-degree z, a straightforward counting argument yields an upper bound M(z, r, 2) = (z+r)2+z+1 for the order of the graph. Apart from the case r = 1, the only three known examples of mixed graphs attaining this bound are Cayley graphs, and there are an infinite number of feasible pairs (r, z) where the existence of mixed Moore graphs with these parameters is unknown. We use a combination of elementary group-theoretical arguments and computational techniques to rule out the existence of further examples of mixed Cayley graphs attaining the Moore bound for all orders up to 485.

On edge singularity and eigenvectors of mixed graphs

2008 ◽  
Vol 24 (1) ◽  
pp. 139-146 ◽  
Author(s):  
Ying Ying Tan ◽  
Yi Zheng Fan
Keyword(s):  
Edge Singularity ◽  
Mixed Graphs

scholarly journals Mixed graphs with H -rank 3

2017 ◽  
Vol 524 ◽  
pp. 22-34 ◽  
Author(s):  
Yi Wang ◽  
Bo-Jun Yuan ◽  
Shuang-Dong Li ◽  
Chong-Jun Wang
Keyword(s):  
Mixed Graphs
Sign in / Sign up

Export Citation Format

Share Document