×
Author ID: gross.daniel-j Recent zbMATH articles by "Gross, Daniel J."
Published as: Gross, Daniel; Gross, D.; Gross, Daniel J.
Homepage: https://www.shu.edu/profiles/danielgross.cfm
External Links: MGP
Documents Indexed: 27 Publications since 1984, including 2 Books
Co-Authors: 13 Co-Authors with 22 Joint Publications
56 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

18 Publications have been cited 41 times in 27 Documents Cited by Year
Invariant formulation of the electromechanical enthalpy function on transversely isotropic piezoelectric materials. Zbl 1145.74348
Schröder, J.; Gross, D.
22
2004
Uniformly optimally reliable graphs. Zbl 1015.68135
Gross, D.; Saccoman, J. T.
15
1998
Graphs with the maximum or minimum number of 1-factors. Zbl 1214.05120
Gross, D.; Kahl, N.; Saccoman, J. T.
7
2010
Spanning tree results for graphs and multigraphs. A matrix-theoretic approach. Zbl 1321.05003
Gross, Daniel J.; Saccoman, John T.; Suffel, Charles L.
3
2015
On the fundamental group of the fixed points of an unipotent action. Zbl 0647.32028
Gross, Daniel
2
1988
Component order edge connectivity – an introduction. Zbl 1112.05058
Boesch, Frank; Gross, Daniel; Kazmierczak, L. William; Suffel, Charles; Suhartomo, Antonius
2
2006
Component order connectivity. Zbl 0951.05064
Boesch, F.; Gross, D.; Suffel, C.
2
1998
Forbidden subgraph conditions on the complement of a graph that insure a strong network design. Zbl 1045.05059
Kazmierczak, L.; Boesch, F.; Suffel, C.; Gross, D.
2
2003
Realizability results involving two connectivity parameters. Zbl 1174.05070
Kazmierczak, L. William; Boesch, F.; Gross, D.; Suffel, C.
1
2007
On weighted component edge connectivity of trees and unicycles. Zbl 1218.05078
Chandra, Lakshmi Iswara; Gross, Daniel; Kazmierczak, L. William; Saccoman, John T.; Suhartomo, Antonius; Suffel, Charles
1
2010
Bounds for the \(k\)-node operating component reliability model. Zbl 0897.68010
Boesch, Frank; Gross, Daniel; Suffel, Charles
1
1997
A coherent model for node reliability. Zbl 0907.68021
Boesch, F.; Gross, D.; Suffel, C.
1
1995
Weighted component edge connectivity of trees and unicycles. II. Zbl 1247.05122
Iswara, L.; Kazmierczak, L. W.; Luttrell, K.; Suffel, C.; Gross, D.; Saccoman, J. T.
1
2011
On neighbor component order edge connectivity. Zbl 1338.05254
Heinig, Monika M.; Gross, Daniel; Saccoman, John T.; Suffel, Charles L.
1
2015
Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling. Zbl 1416.81028
Gläßle, T.; Gross, D.; Chaves, R.
1
2018
The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity. Zbl 1278.05134
Luttrell, Kristi; Iswara, Lakshmi; Kazmierczak, L. William; Suffel, Charles L.; Gross, Daniel J.; Saccoman, John T.
1
2012
A generalization of an edge-connectivity theorem of chartrand. Zbl 1207.05111
Boesch, Frank; Gross, Daniel; Saccoman, John T.; Kazmierczak, L. William; Suffel, Charles; Suhartomo, Antonius
1
2009
GPU-based volume reconstruction from very few arbitrarily aligned X-ray images. Zbl 1203.92047
Gross, Daniel; Heil, Ulrich; Schulze, Ralf; Schoemer, Elmar; Schwanecke, Ulrich
1
2009
Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling. Zbl 1416.81028
Gläßle, T.; Gross, D.; Chaves, R.
1
2018
Spanning tree results for graphs and multigraphs. A matrix-theoretic approach. Zbl 1321.05003
Gross, Daniel J.; Saccoman, John T.; Suffel, Charles L.
3
2015
On neighbor component order edge connectivity. Zbl 1338.05254
Heinig, Monika M.; Gross, Daniel; Saccoman, John T.; Suffel, Charles L.
1
2015
The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity. Zbl 1278.05134
Luttrell, Kristi; Iswara, Lakshmi; Kazmierczak, L. William; Suffel, Charles L.; Gross, Daniel J.; Saccoman, John T.
1
2012
Weighted component edge connectivity of trees and unicycles. II. Zbl 1247.05122
Iswara, L.; Kazmierczak, L. W.; Luttrell, K.; Suffel, C.; Gross, D.; Saccoman, J. T.
1
2011
Graphs with the maximum or minimum number of 1-factors. Zbl 1214.05120
Gross, D.; Kahl, N.; Saccoman, J. T.
7
2010
On weighted component edge connectivity of trees and unicycles. Zbl 1218.05078
Chandra, Lakshmi Iswara; Gross, Daniel; Kazmierczak, L. William; Saccoman, John T.; Suhartomo, Antonius; Suffel, Charles
1
2010
A generalization of an edge-connectivity theorem of chartrand. Zbl 1207.05111
Boesch, Frank; Gross, Daniel; Saccoman, John T.; Kazmierczak, L. William; Suffel, Charles; Suhartomo, Antonius
1
2009
GPU-based volume reconstruction from very few arbitrarily aligned X-ray images. Zbl 1203.92047
Gross, Daniel; Heil, Ulrich; Schulze, Ralf; Schoemer, Elmar; Schwanecke, Ulrich
1
2009
Realizability results involving two connectivity parameters. Zbl 1174.05070
Kazmierczak, L. William; Boesch, F.; Gross, D.; Suffel, C.
1
2007
Component order edge connectivity – an introduction. Zbl 1112.05058
Boesch, Frank; Gross, Daniel; Kazmierczak, L. William; Suffel, Charles; Suhartomo, Antonius
2
2006
Invariant formulation of the electromechanical enthalpy function on transversely isotropic piezoelectric materials. Zbl 1145.74348
Schröder, J.; Gross, D.
22
2004
Forbidden subgraph conditions on the complement of a graph that insure a strong network design. Zbl 1045.05059
Kazmierczak, L.; Boesch, F.; Suffel, C.; Gross, D.
2
2003
Uniformly optimally reliable graphs. Zbl 1015.68135
Gross, D.; Saccoman, J. T.
15
1998
Component order connectivity. Zbl 0951.05064
Boesch, F.; Gross, D.; Suffel, C.
2
1998
Bounds for the \(k\)-node operating component reliability model. Zbl 0897.68010
Boesch, Frank; Gross, Daniel; Suffel, Charles
1
1997
A coherent model for node reliability. Zbl 0907.68021
Boesch, F.; Gross, D.; Suffel, C.
1
1995
On the fundamental group of the fixed points of an unipotent action. Zbl 0647.32028
Gross, Daniel
2
1988

Citations by Year