نتایج جستجو برای: completely e closed graph

تعداد نتایج: 1431890  

Journal: :Pacific Journal of Mathematics 1978

Journal: :Czechoslovak Mathematical Journal 1959

Journal: :Czechoslovak Mathematical Journal 1975

Journal: :International Journal of Mathematics and Mathematical Sciences 1997

Journal: :transactions on combinatorics 2014
veena mathad kishori p. narayankar

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

In this paper, we introduce and characterize fuzzy wea-kly $e$-closed functions in fuzzy topological spaces and the relationship between these mappings and some properties of them are investigated.

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

2004
HYUN PARK

Abstract. Let AE be the canonical AF subalgebra of a graph C ∗-algebra C∗(E) associated with a locally finite directed graph E. For Brown-Voiculescu’s topological entropy ht(ΦE) of the canonical completely positive map ΦE on C∗(E), ht(ΦE) = ht(ΦE |AE ) = hl(E) = hb(E) is known to hold for a finite graph E, where hl(E) is the loop entropy of Gurevic and hb(E) is the block entropy of Salama. For ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید