نتایج جستجو برای: graph product
تعداد نتایج: 470620 فیلتر نتایج به سال:
Stochastic Kronecker Product Graphs are an interesting and useful class of Generative Network Models. They can be fitted using a fast Maximum Likelihood Estimator and reproduce many important statistical properties commonly found in large real-world networks. However, they suffer from an unfortunate drawback: the need to pad the Stochastic Kronecker Product Graph with isolated vertices. To addr...
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs. Given a small simple connected graph which we call basic graph, corona graphs are defined by taking corona product of the basic ...
Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or empty, then so does the graph product. Our second main result gives a presentation for the inverse hull of such a graph product. We then specialise to the ca...
For certain graphs, we can associate a universal C*-algebra, which encodes the information of the graph algebraically. In this paper we examine the relationships between products of graphs and their associated C*-algebras. We present the underlying theory of associating a C*-algebra to a direct graph as well as to a higher rank graph. We then provide several isomorphisms relating C*-algebras of...
A graph G is balanced if the maximum ratio of edges to vertices, taken over all subgraphs of G, occurs at G itself. This note uses the maxow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be combined to form a larger balanced graph. In particular, we show that edge-transitive graphs and comple...
The total irregularity of a graph G is defined as irrt .G/ D 1 2 P u;v2V.G/ jdG.u/ dG.v/j, where dG.u/ denotes the degree of a vertex u 2 V.G/. In this paper we give (sharp) upper bounds on the total irregularity of graphs under several graph operations including join, lexicographic product, Cartesian product, strong product, direct product, corona product, disjunction and symmetric difference....
Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal ...
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑ uv∈E(G) |dG(u)− dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and symmetric difference. ...
In this article we give a new definition of direct product of two arbitrary fuzzy graphs. We define the concepts of domination and total domination in this new product graph. We obtain an upper bound for the total domination number of the product fuzzy graph. Further we define the concept of total α-domination number and derive a lower bound for the total domination number of the product fuzzy ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید