Bartholdi zeta functions for hypergraphs.
Sato, Iwao (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sato, Iwao (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Storm, Christopher K. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sato, Iwao (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mizuno, Hirobumi, Sato, Iwao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cooper, Yaim (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sato, Iwao (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sohn, Moo Young, Lee, Jaeun (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Junqing Cai, Hao Li, Wantao Ning (2014)
Discussiones Mathematicae Graph Theory
Similarity:
For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then...
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Storm, Christopher (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hong-Hai Li, Li Su, Jing Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected...
Yoshimi Egawa, Mikio Kano, Zheng Yan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a star-cycle factor of G if each component of F is a star or cycle. Let G be a graph and f : V (G) → {1, 2, 3, . . .} be a function. Let W = {v ∈ V (G) : f(v) = 1}. Under this notation, it was proved by Berge and Las Vergnas that G has a star-cycle factor F with the property that (i) if a component D of F is a star with center v, then degF (v) ≤ f(v), and (ii) if a component D of F is a cycle, then V (D) ⊆ W if and only if iso(G − S) ≤ Σx∈S...